An Improved Multi-set Algorithm for the Dense Subset Sum Problem

DOI10.1007/978-3-540-79456-1_28zbMath1205.11136OpenAlexW1511462257MaRDI QIDQ5387614

Andrew Shallue

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.iwu.edu/math_scholarship/73

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Density, gaps, topology (11B05)

Related Items (4)

The extended \(k\)-tree algorithm ⋮ Improved combinatorial algorithms for the inhomogeneous short integer solution problem ⋮ Public-Key Cryptographic Primitives Provably as Secure as Subset Sum ⋮ Constructing Carmichael numbers through improved subset-product algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved low-density subset sum algorithms
• Simple proofs of two results on convolutions of unimodal distributions
• Efficient cryptographic schemes provably as secure as subset sum
• Solving low-density subset sum problems
• New directions in cryptography
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Higher-order Carmichael numbers
• Reducibility among Combinatorial Problems
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• STACS 2005

This page was built for publication: An Improved Multi-set Algorithm for the Dense Subset Sum Problem