Evidence that P is not equal to NP

Details Evidence that P is not equal to NP Evidence that P is not equal to NP

2003-10-31

arxiv.org/abs/cs/0310060v7

Computer Science

Computational Complexity

4 pages. Modified to improve writing style

Scientific paper

The question of whether the class of decision problems that can be solved by deterministic polynomial-time algorithms, $P$, is equal to the class of decision problems that can be solved by nondeterministic polynomial-time algorithms, $NP$, has been open since it was first formulated by Cook, Karp, and Levin in 1971. In this paper, we give evidence that they are not equal by examining the SUBSET-SUM problem.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635109