A Discrepancy Lower Bound for Information Complexity

Citation:

Mark Braverman and Weinstein, Omri . 2016. “A Discrepancy Lower Bound For Information Complexity”. Algorithmica, 76, 3, Pp. 846–864. doi:10.1007/s00453-015-0093-8.