ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS (Q4007852): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:18, 6 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS |
scientific article |
Statements
ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS (English)
0 references
27 September 1992
0 references
polynomial paddability
0 references
truth-table reducibility
0 references
randomized algorithm
0 references
non-deterministic polynomial time
0 references
computational complexity theory
0 references
