Recommendations
Cites work
- scientific article; zbMATH DE number 4213909 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1346512 (Why is no real title available?)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
- An Improved Low-Density Subset Sum Algorithm
- Chosen-ciphertext security from subset sum
- Computing Partitions with Applications to the Knapsack Problem
- Improved Generic Algorithms for Hard Knapsacks
- New generic algorithms for hard knapsacks
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Quantum Walk Algorithm for Element Distinctness
- Quantum algorithms for the subset-sum problem
- Quantum walks on graphs
- Search via Quantum Walk
- Solving low density knapsacks
- Solving low-density subset sum problems
Cited in
(6)- scientific article; zbMATH DE number 2051219 (Why is no real title available?)
- Classical and quantum algorithms for variants of subset-sum via dynamic programming
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
- Efficient reductions and algorithms for subset product
- A unified framework of quantum walk search
- Time and Query Complexity Tradeoffs for the Dihedral Coset Problem
This page was built for publication: Subset Sum Quantumly in 1.17 n .
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5889072)
