A characterization of average case communication complexity

DOI10.1016/J.IPL.2006.10.006MaRDI QIDQ845939zbMATH OpenOpenAlexFDO

Authors Martin Dietzfelbinger, Henning Wunderlich

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 complexitydistributed computingtheory of computationcommunication complexityinformation complexityaverage case complexity

Mathematics Subject Classification ID

Recommendations

• Average and randomized communication complexity
• Probabilistic communication complexity
• scientific article; zbMATH DE number 1769898
• LATIN 2004: Theoretical Informatics
• Individual communication complexity

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 2038719 (Why is no real title available?)
• Average and randomized communication complexity
• Communication Complexity
• New applications of the incompressibility method. II
• On communication complexity of vector-valued functions
• Private vs. common random bits in communication complexity

Cited in

(4)

• Average and randomized communication complexity
• On public-coin zero-error randomized communication complexity
• Interactive Information Complexity
• Interactive information complexity

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845939)