Cook reducibility is faster than Karp reducibility in NP (Q751812)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4178764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cook reducibility is faster than Karp reducibility in NP |
scientific article; zbMATH DE number 4178764 |
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
0.7973504662513733
0 references
0.7913457155227661
0 references
0.7875430583953857
0 references
0.7871975302696228
0 references
0.7821065187454224
0 references
