Mark Braverman and Weinstein, Omri . 2012. “A Discrepancy Lower Bound For Information Complexity”. In Approximation, Randomization, And Combinatorial Optimization. Algorithms And Techniques - 15Th International Workshop, Approx 2012, And 16Th International Workshop, Random 2012, Cambridge, Ma, Usa, August 15-17, 2012. Proceedings, 7408:Pp. 459–470. Springer. doi:10.1007/978-3-642-32512-0\_39.