Faster algorithms for \(k\)-subset sum and variations (Q2105266): Difference between revisions
From MaRDI portal
Latest revision as of 00:49, 31 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Faster algorithms for \(k\)-subset sum and variations |
scientific article |
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