Automata, Languages and Programming

DOI10.1007/11523468zbMath1081.68033OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716755

Frédéric Magniez, Ashwin Nayak

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

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Related Items (5)

Quantum algorithms for matching problems ⋮ Quantum property testing of group solvability ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ Quantum algorithms for learning and testing juntas ⋮ The quantum query complexity of the determinant

This page was built for publication: Automata, Languages and Programming