Faster algorithms for \(k\)-subset sum and variations (Q2105266)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Faster algorithms for \(k\)-subset sum and variations |
scientific article; zbMATH DE number 7628902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster algorithms for \(k\)-subset sum and variations |
scientific article; zbMATH DE number 7628902 |
Statements
Faster algorithms for \(k\)-subset sum and variations (English)
0 references
8 December 2022
0 references
color coding
0 references
FFT
0 references
\(k\)-subset sum
0 references
multiple knapsack
0 references
multiple subset sum
0 references
pseudopolynomial algorithms
0 references
subset sum
0 references
