On a subset sum algorithm and its probabilistic and other applications

MaRDI QIDQ4353161zbMATH OpenFDO

Authors Vassilly. Voinov, Mikhail Nikulin

Publication date 30 August 1998

zbMATH Keywords

compositionscryptographyDiophantine equationdiscrete probability distributiongenerating functionknapsack problempartitionssubset sum problem

Mathematics Subject Classification ID

Linear Diophantine equations (11D04) Diophantine approximation in probabilistic number theory (11K60) Computer solution of Diophantine equations (11Y50) Combinatorial probability (60C05)

Recommendations

• An almost linear-time algorithm for the dense subset-sum problem
• Solving dense subset-sum problems by using analytical number theory
• scientific article; zbMATH DE number 4149895
• On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem

Cited in

(4)

• Multivariate discrete distributions induced by an urn scheme, linear Diophantine equations, unbiased estimating, testing and applications
• Stochastic analysis of greedy algorithms for the subset sum problem
• Scheduling lower bounds via AND subset sum
• New analytical results in subset-sum problem

This page was built for publication: On a subset sum algorithm and its probabilistic and other applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353161)