ICALP
1995
Springer
14 years 3 months ago
1995
Springer
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
STACS
2010
Springer
14 years 6 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...