Subset-sum problems with different summands: Computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4149895 (Why is no real title available?)
- scientific article; zbMATH DE number 4089636 (Why is no real title available?)
- scientific article; zbMATH DE number 3719153 (Why is no real title available?)
- scientific article; zbMATH DE number 1315279 (Why is no real title available?)
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- On representation of r-th powers by subset sums
- On sums of subsets of a set of integers
- On two additive problems
Cited in
(9)- scientific article; zbMATH DE number 7688183 (Why is no real title available?)
- Subset sum problems with digraph constraints
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks
- Estimating the cardinality of a difference subset of the discrete multi-torus \(\mathbb Z_3^n\)
- The complexity of unary subset sum
- scientific article; zbMATH DE number 553907 (Why is no real title available?)
- The subset sum problem
- scientific article; zbMATH DE number 4149895 (Why is no real title available?)
- An asymptotic formula for the cardinality of a difference subset of the multidimensional torus \(\mathbb{Z}_3^n\)
This page was built for publication: Subset-sum problems with different summands: Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922292)