scientific article; zbMATH DE number 1769898

zbMath0995.68052MaRDI QIDQ4540518

László Babai, Peter G. Kimmel

Publication date: 22 July 2002

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

zbMATH Keywords

communication gameSimultaneous Messages model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (14)

The communication complexity of the Hamming distance problem ⋮ Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model ⋮ Equality, Revisited ⋮ Nearly optimal property preserving hashing ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ Unnamed Item ⋮ Unbounded-Error Classical and Quantum Communication Complexity ⋮ Approximate F_2-Sketching of Valuation Functions ⋮ Distinguishing two probability ensembles with one sample from each ensemble ⋮ Public vs. private randomness in simultaneous multi-party communication complexity ⋮ The role of randomness in the broadcast congested clique model ⋮ Optimality of linear sketching under modular updates ⋮ Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity ⋮ Quantum communication and complexity.

This page was built for publication: