ON THE COMPLEXITY OF COMPUTING OPTIMAL SOLUTIONS (Q4007852): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054191000133 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985204981 / rank | |||
Normal rank | |||
Latest revision as of 08:46, 30 July 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
