An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Computational Complexity
2015-03-14 v1
Abstract
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.
Cite
@article{arxiv.1004.3993,
title = {An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity},
author = {David Doty},
journal= {arXiv preprint arXiv:1004.3993},
year = {2015}
}