Sciweavers

COCO
2003
Springer
93views Algorithms» more  COCO 2003»
14 years 3 months ago
Are Cook and Karp Ever the Same?
We consider the question whether there exists a set A such that every set polynomial-time Turing equivalent to A is also many-one equivalent to A. We show that if E = NE then no s...
Richard Beigel, Lance Fortnow