scientific article
From MaRDI portal
Publication:3002814
DOI10.4086/TOC.2010.V006A001zbMath1213.68282OpenAlexW2122271558MaRDI QIDQ3002814
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2010.v006a001
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)
Related Items (1)
This page was built for publication:
