Classical and quantum algorithms for variants of subset-sum via dynamic programming
From MaRDI portal
Cites work
- A near-linear pseudopolynomial time algorithm for subset sum
- Average-case subset balancing problems
- Bounding the running time of algorithms for scheduling and packing problems
- Claw finding algorithms using quantum walk
- Computing Partitions with Applications to the Knapsack Problem
- Efficient approximation algorithms for the subset-sums equality problem.
- Equal-subset-sum faster than the meet-in-the-middle
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming.
- Hardness of approximation for knapsack problems
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 3316587 (Why is no real title available?)
- Improved classical and quantum algorithms for subset-sum
- Improved Generic Algorithms for Hard Knapsacks
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- New generic algorithms for hard knapsacks
- On the equal-subset-sum problem
- On total functions, existence theorems and computational complexity
- Open problems around exact algorithms
- PPP-completeness with connections to cryptography
- Quantum algorithms for the subset-sum problem
- Quantum speedups for exponential-time dynamic programming algorithms
- Quantum Walk Algorithm for Element Distinctness
- Reducibility among combinatorial problems
- Search via Quantum Walk
- SETH-based lower bounds for subset sum and bicriteria path
- Subset Sum Quantumly in 1.17 n .
- Variable time amplitude amplification and quantum algorithms for linear algebra problems
Cited in
(2)- A faster algorithm for pigeonhole equal sums
- New algorithms for pigeonhole equal subset sum
This page was built for publication: Classical and quantum algorithms for variants of subset-sum via dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969685)
