Skip to main navigation Skip to search Skip to main content

Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness

  • Mark Braverman
  • , Ankit Garg
  • , Young Kun Ko
  • , Jieming Mao
  • , Dave Touchette

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fingerprint

Dive into the research topics of 'Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness'. Together they form a unique fingerprint.
Sort by

Keyphrases

Mathematics

Computer Science