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

Mark Braverman et al. (2018)

Details and statistics

DOI: 10.1137/16M1061400

access: closed

type: Journal Article

metadata version: 2019-04-05

a service of  Schloss Dagstuhl - Leibniz Center for Informatics