
PolynomialTime Random Oracles and Separating Complexity Classes
Bennett and Gill (1981) showed that P^A != NP^A != coNP^A for a random o...
read it

Nondeterminisic Sublinear Time Has Measure 0 in P
The measure hypothesis is a quantitative strengthening of the P != NP co...
read it

Nonuniform Reductions and NPCompleteness
Nonuniformity is a central concept in computational complexity with powe...
read it
John M. Hitchcock
is this you? claim profile