"Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity ..."

Mark Braverman et al. (2018)

> Home

Details and statistics

DOI: 10.1137/16M1061400

access: closed

type: Journal Article

metadata version: 2019-04-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/BravermanGKMT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/BravermanGKMT18
Mark Braverman, Ankit Garg, Young Kun-Ko, Jieming Mao, Dave Touchette:
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness. SIAM J. Comput. 47(6): 2277-2314 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.