Equality, Revisited

DOI10.1007/978-3-662-48054-0_11zbMath1465.68094arXiv1511.01211OpenAlexW4255479808WikidataQ58040179 ScholiaQ58040179MaRDI QIDQ2946382

Dmitry Gavinsky, Hartmut Klauck, Ralph Bottesch

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.01211

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12) Communication complexity, information complexity (68Q11)

Related Items (2)

Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficiency, KMS condition and relative entropy in von Neumann algebras
• Private vs. common random bits in communication complexity
• Quantum communication and complexity.
• Communication complexity in a 3-computer model
• Two Results about Quantum Messages
• Cryptographic distinguishability measures for quantum-mechanical states
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Communication Complexity
• Interaction in quantum communication and the complexity of set disjointness
• Algorithms and Computation

This page was built for publication: Equality, Revisited