An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (Q3985814)
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: An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem |
scientific article; zbMATH DE number 27809
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem |
scientific article; zbMATH DE number 27809 |
Statements
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem (English)
0 references
27 June 1992
0 references
NP-hard
0 references
subset-sum
0 references
integer programming
0 references
dense problems
0 references
