An Improved Multi-set Algorithm for the Dense Subset Sum Problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1246230 (Why is no real title available?)
- scientific article; zbMATH DE number 1315279 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Efficient cryptographic schemes provably as secure as subset sum
- Higher-order Carmichael numbers
- Improved low-density subset sum algorithms
- New directions in cryptography
- Reducibility among combinatorial problems
- STACS 2005
- Simple proofs of two results on convolutions of unimodal distributions
- Solving low-density subset sum problems
Cited in
(7)- Constructing Carmichael numbers through improved subset-product algorithms
- Fast modular subset sum using linear sketching
- The extended \(k\)-tree algorithm
- Dimensional e\textsf{ROS}ion: improving the \textsf{ROS} attack with decomposition in higher bases
- On Wagner's k-tree algorithm over integers
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
This page was built for publication: An Improved Multi-set Algorithm for the Dense Subset Sum Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387614)
