Lower bounds on the randomized communication complexity of read-once functions
From MaRDI portal
Publication:626679
DOI10.1007/s00037-010-0292-2zbMath1229.68042OpenAlexW2097234068MaRDI QIDQ626679
Nikos Leonardos, Michael E. Saks
Publication date: 18 February 2011
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-010-0292-2
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Information theory (general) (94A15)
Related Items (4)
Interactive Information Complexity ⋮ Interactive Information Complexity ⋮ Communication complexity with small advantage ⋮ Unnamed Item
This page was built for publication: Lower bounds on the randomized communication complexity of read-once functions
