Login / Signup
Near-optimal bounds on bounded-round quantum communication complexity of disjointness.
Mark Braverman
Ankit Garg
Young Kun-Ko
Jieming Mao
Dave Touchette
Published in:
CoRR (2015)
Keyphrases
</>
worst case
communication systems
lower bound
upper bound
computational complexity
computational cost
communication networks
asymptotically optimal
data sets
neural network
information sharing
decision problems
error bounds
space complexity
automatic discovery
error tolerance