scientific article; zbMATH DE number 1256775
From MaRDI portal
Publication:4228511
Recommendations
Cited in
(22)- Quantum communication and complexity.
- The role of randomness in the broadcast congested clique model
- On public-coin zero-error randomized communication complexity
- Public vs. private randomness in simultaneous multi-party communication complexity
- Fooling pairs in randomized communication complexity
- Public vs. private randomness in simultaneous multi-party communication complexity
- Equality, revisited
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
- Proofs of proximity for distribution testing
- Simultaneous multiparty communication protocols for composed functions
- Distinguishing two probability ensembles with one sample from each ensemble
- Public vs private coin in bounded-round information
- Verifiable stream computation and Arthur-Merlin communication
- Unbounded-Error Classical and Quantum Communication Complexity
- The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism
- Area laws and efficient descriptions of quantum many-body states
- scientific article; zbMATH DE number 7765409 (Why is no real title available?)
- Nearly optimal property preserving hashing
- Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
- Tight bounds for the randomized and quantum communication complexities of equality with small error
- Shared versus private randomness in distributed interactive proofs
- The communication complexity of the Hamming distance problem
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 Q4228511)
