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

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

2010-04-22

arxiv.org/abs/1004.3993v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-460219