scientific article; zbMATH DE number 1361464

MaRDI QIDQ4699282zbMATH OpenFDO

Authors László Babai

Publication date 10 November 1999

zbMATH Keywords

multi-party communication complexity theory

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1775457
• The cost of the missing bit: Communication complexity with help
• Communication Complexity

Cited in

(17)

• scientific article; zbMATH DE number 2134904 (Why is no real title available?)
• scientific article; zbMATH DE number 4147508 (Why is no real title available?)
• One-round multi-party communication complexity of distinguishing sums
• Communication Complexity
• New bounds on the half-duplex communication complexity
• scientific article; zbMATH DE number 1011685 (Why is no real title available?)
• scientific article; zbMATH DE number 1775457 (Why is no real title available?)
• STACS 2004
• Automata, Languages and Programming
• Communication complexity
• An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
• On the complexity of communication complexity
• Space-bounded communication complexity
• The communication complexity of addition
• Property testing lower bounds via communication complexity
• Individual communication complexity
• On a theorem of Razborov

This page was built for publication:

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