New answers tagged oracles
1
vote
Is $\sf P\neq NP\cap coNP$ relative to random oracle still open?
It is indeed still open, and for good reason.
A combinatorial conjecture of Rudich and Impagliazzo implies that $\mathsf{P} \neq \mathsf{NP}\cap\mathsf{coNP}$ relative to a random oracle implies $\...
Top 50 recent answers are included
Related Tags
oracles × 112cc.complexity-theory × 60
complexity-classes × 32
relativization × 19
reference-request × 10
computability × 10
polynomial-hierarchy × 9
quantum-computing × 7
counting-complexity × 7
random-oracles × 6
circuit-complexity × 5
ds.algorithms × 4
optimization × 4
time-complexity × 4
sat × 4
cr.crypto-security × 4
reductions × 4
polynomial-time × 4
np-hardness × 3
turing-machines × 3
linear-programming × 3
np × 3
pspace × 3
nexp × 3
separation × 3