Quantum Queries on Permutations with a Promise

DOI10.1007/978-3-642-02979-0_24zbMath1248.68199OpenAlexW1811635868MaRDI QIDQ3637358

Kazuo Iwama, Rūsiņš Freivalds

Publication date: 9 July 2009

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02979-0_24

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Superiority of exact quantum automata for promise problems ⋮ Quantum Queries on Permutations

Cites Work

• Complexity measures and decision tree complexity: a survey.
• Rapid solution of problems by quantum computation
• Quantum algorithms revisited
• Quantum lower bounds by polynomials
• Quantum lower bounds by quantum arguments
• Unnamed Item

This page was built for publication: Quantum Queries on Permutations with a Promise