A characterization of average case communication complexity

DOI10.1016/j.ipl.2006.10.006zbMath1184.68251OpenAlexW2053067794MaRDI QIDQ845939

Henning Wunderlich, Martin Dietzfelbinger

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.10.006

zbMATH Keywords

computational complexityinformation complexitydistributed computingtheory of computationcommunication complexityaverage case complexity

Mathematics Subject Classification ID

Related Items (3)

Interactive Information Complexity ⋮ Interactive Information Complexity ⋮ On public-coin zero-error randomized communication complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Private vs. common random bits in communication complexity
• New applications of the incompressibility method. II
• Average and randomized communication complexity
• On communication complexity of vector-valued functions
• Communication Complexity

This page was built for publication: A characterization of average case communication complexity