scientific article; zbMATH DE number 139903

MaRDI QIDQ4028243zbMATH OpenFDO

Authors Mark Chaimovich

Publication date 28 March 1993

zbMATH Keywords

additive number theory\(n\)-dimensional subset sum problempseudo- polynomial time algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Boolean programming (90C09)

Recommendations

• Solving dense subset-sum problems by using analytical number theory
• scientific article; zbMATH DE number 176777
• Improved low-density subset sum algorithms
• An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
• Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach

Cited in

(4)

• Erratum to: ``New analytical results in subset-sum problem
• Solving dense subset-sum problems by using analytical number theory
• On threshold properties of k-SAT: An additive viewpoint
• Top-𝑘-convolution and the quest for near-linear output-sensitive subset sum

This page was built for publication:

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