Sciweavers

COCO
1998
Springer
100views Algorithms» more  COCO 1998»
13 years 9 months ago
Uniformly Hard Languages
Ladner [18] showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to ...
Rodney G. Downey, Lance Fortnow