scientific article; zbMATH DE number 1361464

zbMath0941.68088MaRDI QIDQ4699282

László Babai

Publication date: 10 November 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (3)

On a theorem of Razborov ⋮ An exponential separation between \textsf{MA} and \textsf{AM} proofs of proximity ⋮ Property testing lower bounds via communication complexity

This page was built for publication: