Cook reducibility is faster than Karp reducibility in NP (Q751812): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-0000(90)90026-h / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1985343313 / rank | |||
Normal rank | |||
Latest revision as of 10:54, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cook reducibility is faster than Karp reducibility in NP |
scientific article |
Statements
Cook reducibility is faster than Karp reducibility in NP (English)
0 references
1990
0 references
reducibility
0 references
NP-complete sets
0 references
0 references
