Subset Sum Quantumly in 1.17 n .
From MaRDI portal
Publication:5889072
DOI10.4230/LIPIcs.TQC.2018.5OpenAlexW2886122829MaRDI QIDQ5889072
Publication date: 26 April 2023
Full work available at URL: https://dblp.uni-trier.de/db/conf/tqc/tqc2018.html#HelmM18
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Chosen-Ciphertext Security from Subset Sum
- Search via Quantum Walk
- Improved Generic Algorithms for Hard Knapsacks
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- New Generic Algorithms for Hard Knapsacks
- Solving low-density subset sum problems
- 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
- Computing Partitions with Applications to the Knapsack Problem
- Quantum Algorithms for the Subset-Sum Problem
- Solving Low Density Knapsacks
- Quantum walks on graphs
- Quantum Walk Algorithm for Element Distinctness
This page was built for publication: Subset Sum Quantumly in 1.17 n .
