New bounds on classical and quantum one-way communication complexity
From MaRDI portal
Publication:1029354
DOI10.1016/j.tcs.2008.10.014zbMath1172.68021arXiv0802.4101MaRDI QIDQ1029354
Publication date: 10 July 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.4101
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
81P68: Quantum computation
Related Items
Cites Work
- Private vs. common random bits in communication complexity
- On the distributional complexity of disjointness
- Fat-shattering and the learnability of real-valued functions
- On the density of families of sets
- Learnability and the Vapnik-Chervonenkis dimension
- The learnability of quantum states
- On the Power of Quantum Memory
- The Bounded-Storage Model in the Presence of a Quantum Adversary
- Communication Complexity
- The Communication Complexity of Correlation
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item