A discrepancy lower bound for information complexity

DOI10.1007/978-3-642-32512-0_39MaRDI QIDQ6826380zbMATH OpenFDO

Authors Mark Braverman, O. Weinstein

Publication date 2 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

This page was built for publication: A discrepancy lower bound for information complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826380)