NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets

LATIN 2012: Theoretical Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-29344-3_32 ◽

2012 ◽

pp. 375-386

Author(s):

Bin Fu

Download Full-text