scientific article; zbMATH DE number 1315279
From MaRDI portal
Publication:4256495
The ideas of the paper in the preceding review Zbl 0987.90093) are applied to a special case of the following problem: Let \(A= \{a_1,\dots, a_n\}\), \(a_i\in \mathbb{N}\). For \(B\subseteq A\) let \(S_B= \sum_{a_i\in B}a_i\) and let \(A^*= \{S_B\mid B\subseteq A\}\). Find the maximal subset sums \(S^*\in A^*\) satisfying \(S^*\leq M\) for given \(M\in\mathbb{N}\). For the entire collection see [Zbl 0919.00044].
Recommendations
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)