Solving medium-density subset sum problems in expected polynomial time
From MaRDI portal
Recommendations
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
- An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
- An almost linear-time algorithm for the dense subset-sum problem
- Dense subset sum may be the hardest
- Solving low-density subset sum problems
Cited in
(13)- A polynomial-time algorithm for solving the hidden subset sum problem
- Solving low-density multiple subset sum problems with SVP oracle
- Constructing Carmichael numbers through improved subset-product algorithms
- Subset sum in the absence of concentration
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
- Solving low-density subset sum problems
- An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
- An almost linear-time algorithm for the dense subset-sum problem
- Succinct Certificates for Almost All Subset Sum Problems
- Dense subset sum may be the hardest
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems
- An Improved Multi-set Algorithm for the Dense Subset Sum Problem
This page was built for publication: Solving medium-density subset sum problems in expected polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710684)