Comparing reductions to NP-complete sets (Q879596)
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 5152424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing reductions to NP-complete sets |
scientific article; zbMATH DE number 5152424 |
Statements
Comparing reductions to NP-complete sets (English)
0 references
14 May 2007
0 references
nonadaptive reductions
0 references
deterministic reductions
0 references
polynomial-size circuits
0 references
0.991704285144806
0 references
0.8277661204338074
0 references
0.8098374009132385
0 references
0.8089991211891174
0 references
