Quantum speedups for polynomial-time dynamic programming algorithms
From MaRDI portal
Cites work
- A panoply of quantum algorithms
- Algorithms for Multi-Criteria Boundary Labeling
- Algorithms for Multi-criteria One-Sided Boundary Labeling
- An O(n^3 n / ^2 n) time algorithm for all pairs shortest paths
- Exponential-time quantum algorithms for graph coloring problems
- Faster Scaling Algorithms for Network Problems
- Faster single-source shortest paths with negative real weights via proper hop distance
- General context-free recognition in less than cubic time
- scientific article; zbMATH DE number 3637281 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 7561744 (Why is no real title available?)
- scientific article; zbMATH DE number 3335488 (Why is no real title available?)
- Introduction to algorithms.
- Matrix multiplication via arithmetic progressions
- Minimal Triangulations of Polygonal Domains
- Moderate exponential-time algorithms for scheduling problems
- New bounds for matrix multiplication: from alpha to omega
- On a routing problem
- On the approximation of curves by line segments using dynamic programming
- Open problems around exact algorithms
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs
- Quantum algorithms for computational geometry problems
- Quantum algorithms for Hopcroft's problem
- Quantum algorithms for one-sided crossing minimization
- Quantum algorithms for one-sided crossing minimization
- Quantum combine and conquer and its applications to sublinear quantum convex hull and maxima set construction
- Quantum graph drawing (best student paper)
- Quantum random access memory
- Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
- Quantum speedups for exponential-time dynamic programming algorithms
- Quantum speedups for treewidth
- Recognition and parsing of context-free languages in time n3
- Scaling algorithms for network problems
- Scaling Algorithms for the Shortest Paths Problem
- The Solovay--Kitaev algorithm
- Trajectory-based dynamic map labeling
This page was built for publication: Quantum speedups for polynomial-time dynamic programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312561)
