Average and randomized communication complexity

DOI10.1109/18.50368zbMath0702.94001OpenAlexW2159549640MaRDI QIDQ3481627

Abbas El Gamal, Alon Orlitsky

Publication date: 1990

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.50368

zbMATH Keywords

randomizationBoolean functionscomputation errorscommunication complexity of a two-variable functioncommunication- complexity measures

Mathematics Subject Classification ID

Communication theory (94A05)

Related Items (6)

A characterization of average case communication complexity ⋮ A comparison of two lower-bound methods for communication complexity ⋮ On a theorem of Razborov ⋮ One-message statistical Zero-Knowledge Proofs and space-bounded verifier ⋮ Unnamed Item ⋮ Communication protocols for secure distributed computation of binary functions.

This page was built for publication: Average and randomized communication complexity