Automata, Languages and Programming

DOI10.1007/11523468zbMath1081.68025OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716754

Mario Szegedy, Robert Špalek

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Quantum computation (81P68) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Quantum separation of local search and fixed point computation, Polynomial degree vs. quantum query complexity, On the power of Ambainis lower bounds, Adversary lower bounds for nonadaptive quantum algorithms, Unnamed Item