A discrepancy lower bound for information complexity

DOI10.1007/s00453-015-0093-8zbMath1353.68088arXiv1112.2000MaRDI QIDQ343867

Mark Braverman, Omri Weinstein

Publication date: 29 November 2016

Published in: Algorithmica, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.2000

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)