A new linear storage, polynomial-time approximation scheme for the subset-sum problem (Q1822965)
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: A new linear storage, polynomial-time approximation scheme for the subset-sum problem |
scientific article; zbMATH DE number 4114001
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new linear storage, polynomial-time approximation scheme for the subset-sum problem |
scientific article; zbMATH DE number 4114001 |
Statements
A new linear storage, polynomial-time approximation scheme for the subset-sum problem (English)
0 references
1990
0 references
polynomial approximation schemes
0 references
computational analysis
0 references
subset-sum
0 references
