On the complexity of communication complexity
From MaRDI portal
Publication:5172741
DOI10.1145/1536414.1536479zbMath1304.68077OpenAlexW2005285611MaRDI QIDQ5172741
Enav Weinreb, Eyal Kushilevitz
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536479
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Some improved bounds on communication complexity via new decomposition of cliques ⋮ On the extension complexity of polytopes separating subsets of the Boolean cube ⋮ The Complexity of Complexity ⋮ Unnamed Item ⋮ Exponential Lower Bounds for Polytopes in Combinatorial Optimization ⋮ Ordered biclique partitions and communication complexity problems
This page was built for publication: On the complexity of communication complexity
