ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS (Q4007852): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q6482543 |
Changed an Item |
||
| Property / author | |||
| Property / author: Seinosuke Toda / rank | |||
Normal rank | |||
Latest revision as of 13:04, 18 April 2025
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
