Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
From MaRDI portal
Publication:5236291
DOI10.1137/1.9781611975482.107zbMath1432.68158arXiv1807.05209OpenAlexW2883221138MaRDI QIDQ5236291
Jevgēnijs Vihrovs, Jānis Iraids, Martins Kokainis, Kaspars Balodis, Krišjānis Prūsis, Andris Ambainis
Publication date: 15 October 2019
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.05209
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Dynamic programming (90C39) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (6)
An introduction to variational quantum algorithms for combinatorial optimization problems ⋮ Quantum bounds for 2D-grid and Dyck language ⋮ Quantum complexity for vector domination problem ⋮ Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems ⋮ Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. ⋮ Exponential-time quantum algorithms for graph coloring problems
This page was built for publication: Quantum Speedups for Exponential-Time Dynamic Programming Algorithms
