Composition Theorems in Communication Complexity
From MaRDI portal
Publication:3587401
DOI10.1007/978-3-642-14165-2_41zbMath1288.68065arXiv1003.1443OpenAlexW2114806597MaRDI QIDQ3587401
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.1443
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity ⋮ Approximate Degree in Classical and Quantum Computing ⋮ Around the log-rank conjecture ⋮ Approximate F_2-Sketching of Valuation Functions ⋮ Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models ⋮ Fourier Sparsity of GF(2) Polynomials ⋮ Simulation theorems via pseudo-random properties ⋮ Rectangles Are Nonnegative Juntas ⋮ Counting the number of perfect matchings, and generalized decision trees ⋮ Unnamed Item
This page was built for publication: Composition Theorems in Communication Complexity
