scientific article; zbMATH DE number 1361464

zbMATH Open0941.68088MaRDI QIDQ4699282FDOQ4699282

László Babai

Publication date: 10 November 1999

Title of this publication is not available (Why is that?)

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)

Cited In (12)

• On the complexity of communication complexity
• An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity
• Space-bounded communication complexity
• Property testing lower bounds via communication complexity
• Communication Complexity
• Individual communication complexity
• On a theorem of Razborov
• The communication complexity of addition
• Title not available (Why is that?)
• Automata, Languages and Programming
• Title not available (Why is that?)
• Title not available (Why is that?)

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)