ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS (Q4007852)
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: ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS |
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
