Does P = NP?

Details Does P = NP? Does P = NP?

2002-08-12

arxiv.org/abs/cs/0208018v2

Computer Science

Computational Complexity

withdrawn. It was a rediculously stupid notion

Scientific paper

This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it remains theoretically possible for there to yet exist a non-deterministically polynomial (NP) problem for which the algorithm does not provide a polynomial (P) time solution. The paper leaves open as subject of continuing research the question of existence of instance of conjectured problem.

Affiliated with

Also associated with

No associations

Rating

Does P = NP? 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 Does P = NP?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Does P = NP? will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-268941