scientific article; zbMATH DE number 6146443
From MaRDI portal
Publication:4910707
DOI10.4230/LIPICS.STACS.2008.1333zbMath1259.68069arXivquant-ph/0609168MaRDI QIDQ4910707
Publication date: 19 March 2013
Full work available at URL: https://arxiv.org/abs/quant-ph/0609168
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)
This page was built for publication:
