scientific article

DOI10.4230/LIPIcs.STACS.2013.424zbMath1354.68087arXiv1204.4619MaRDI QIDQ2957903

Hartmut Klauck, Ronald de Wolf

Publication date: 30 January 2017

Full work available at URL: https://arxiv.org/abs/1204.4619

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower boundquantum computingcommunication complexityfooling set

Mathematics Subject Classification ID

Network protocols (68M12) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

The (minimum) rank of typical fooling-set matrices ⋮ Fooling-sets and rank

This page was built for publication: