Quantum algorithms for Hopcroft's problem
From MaRDI portal
Cites work
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Claw finding algorithms using quantum walk
- Computing and Combinatorics
- Consequences of Faster Alignment of Sequences
- Cutting hyperplanes for divide-and-conquer
- Deterministic APSP, Orthogonal Vectors, and More
- Dynamic point location in arrangements of hyperplanes
- Finding orthogonal vectors in discrete structures
- Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2038718 (Why is no real title available?)
- scientific article; zbMATH DE number 2080987 (Why is no real title available?)
- scientific article; zbMATH DE number 7561744 (Why is no real title available?)
- scientific article; zbMATH DE number 7829263 (Why is no real title available?)
- Improved quantum algorithm for triangle finding via combinatorial arguments
- Memory compression with quantum random-access gates
- More applications of the polynomial method to algorithm design
- New lower bounds for Hopcroft's problem
- Optimal partition trees
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games
- Quantum algorithms for computational geometry problems
- Quantum Computation in Computational Geometry
- Quantum lower bound for the collision problem with small range
- Quantum random access memory
- Quantum verification of matrix products
- Quantum Walk Algorithm for Element Distinctness
- Quantum-walk speedup of backtracking algorithms
- Quasi-optimal range searching in spaces of finite VC-dimension
- Range searching with efficient hierarchical cuttings
- Search via Quantum Walk
- Simplex range reporting on a pointer machine
- Simplex Range Searching and Its Variants: A Review
- Simplex range searching revisited: how to shave logs in multi-level data structures
- Strengths and Weaknesses of Quantum Computing
- The quantum query complexity of read-many formulas
- Tight quantum bounds for computational geometry problems
This page was built for publication: Quantum algorithms for Hopcroft's problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241006)
