Sciweavers

Share
CORR
2010
Springer

An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity

10 years 12 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We refine the technique to strengthen the result, constructing an oracle relative to which a conjecture of Lipton is false.
David Doty
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2010
Where CORR
Authors David Doty
Comments (0)
books