A characterization of average case communication complexity

DOI10.1016/J.IPL.2006.10.006zbMATH Open1184.68251OpenAlexW2053067794MaRDI QIDQ845939FDOQ845939

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

Recommendations

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

zbMATH Keywords

computational complexitydistributed computingtheory of computationcommunication complexityinformation complexityaverage case complexity

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• Communication Complexity
• Private vs. common random bits in communication complexity
• Title not available (Why is that?)
• Average and randomized communication complexity
• New applications of the incompressibility method. II
• On communication complexity of vector-valued functions

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)