Cook reducibility is faster than Karp reducibility in NP (Q751812): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:24, 30 January 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
