A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem (Q5375394): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/12.73593 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2151152538 / rank | |||
Normal rank | |||
Latest revision as of 03:09, 20 March 2024
scientific article; zbMATH DE number 6936988
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem |
scientific article; zbMATH DE number 6936988 |
Statements
A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem (English)
0 references
14 September 2018
0 references
