Quantum Weakly Nondeterministic Communication Complexity

DOI10.1007/11821069_57zbMath1132.68415OpenAlexW2568056228MaRDI QIDQ5756686

François Le Gall

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11821069_57

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Unbounded-error quantum query complexity ⋮ Exponential separation of quantum and classical online space complexity

This page was built for publication: Quantum Weakly Nondeterministic Communication Complexity