scientific article; zbMATH DE number 1315279

MaRDI QIDQ4256495zbMATH OpenFDO

Authors Mark Chaimovich

Publication date 13 July 1999

zbMATH Keywords

analytical number theoryinteger programmingsubset sum problem

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
• scientific article; zbMATH DE number 176777
• Subset-sum problems with different summands: Computation
• Solving dense subset-sum problems by using analytical number theory

Cited in

(8)

• Solving dense subset-sum problems by using analytical number theory
• When subset-sums do not cover all the residues modulo \(p\).
• Constructing Carmichael numbers through improved subset-product algorithms
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• An Improved Multi-set Algorithm for the Dense Subset Sum Problem
• New analytical results in subset-sum problem
• On subset sums of \(r\)-sets
• Subset-sum problems with different summands: Computation

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 Q4256495)