A parallel two-list algorithm for the knapsack problem (Q1392066): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127451684 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0167-8191(96)00085-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064207223 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:38, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel two-list algorithm for the knapsack problem |
scientific article |
Statements
A parallel two-list algorithm for the knapsack problem (English)
0 references
23 July 1998
0 references
knapsack problem
0 references
NP-complete problems
0 references
parallel algorithms
0 references
cryptosystem
0 references
