scientific article; zbMATH DE number 1256775
From MaRDI portal
Publication:4228511
zbMath0936.68050MaRDI QIDQ4228511
Publication date: 22 May 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (16)
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity ⋮ The communication complexity of the Hamming distance problem ⋮ Equality, Revisited ⋮ Nearly optimal property preserving hashing ⋮ Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unbounded-Error Classical and Quantum Communication Complexity ⋮ Proofs of Proximity for Distribution Testing ⋮ 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 ⋮ Verifiable Stream Computation and Arthur--Merlin Communication ⋮ Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity ⋮ Area laws and efficient descriptions of quantum many-body states ⋮ Quantum communication and complexity.
This page was built for publication:
