Login / Signup
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness.
Mark Braverman
Ankit Garg
Young Kun-Ko
Jieming Mao
Dave Touchette
Published in:
SIAM J. Comput. (2018)
Keyphrases
</>
worst case
lower bound
asymptotically optimal
upper bound
data sets
computational complexity
communication networks
quantum inspired
search algorithm
evolutionary algorithm
np hard
space complexity
contingency tables