Automata, Languages and Programming

DOI10.1007/b99859zbMath1099.68640OpenAlexW2505584480MaRDI QIDQ5466487

Peter Høyer, Mark Heiligman, Mehdi Mhalla, Christoph Dürr

Publication date: 24 August 2005

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Quantum algorithms for matching problems ⋮ Improved algorithms for quantum identification of Boolean oracles ⋮ A survey on tree matching and XML retrieval ⋮ Quantum algorithm for dynamic programming approach for DAGs and applications ⋮ Quantum speed-up for unsupervised learning ⋮ Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation ⋮ The quantum query complexity of the determinant ⋮ On the power of Ambainis lower bounds ⋮ Quantum algorithm for shortest path search in directed acyclic graph

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