An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q61638376, #quickstatements; #temporary_batch_1706974296281 |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Knapsack / rank | |||
Normal rank | |||
Revision as of 12:45, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient fully polynomial approximation scheme for the Subset-Sum problem. |
scientific article |
Statements
An efficient fully polynomial approximation scheme for the Subset-Sum problem. (English)
0 references
13 August 2003
0 references
Subset-sum problem
0 references
Worst-case performance
0 references
Fully polynomial approximation scheme
0 references
Knapsack problem
0 references
