Algorithm that Solves 3-SAT in Polynomial Time

Details Algorithm that Solves 3-SAT in Polynomial Time Algorithm that Solves 3-SAT in Polynomial Time

2011-10-05

arxiv.org/abs/1110.1658v1

Computer Science

Computational Complexity

5 pages, 2 tables

Scientific paper

The question of whether the complexity class P is equal to the complexity class NP has been a seemingly intractable problem for over 4 decades. It has been clear that if an algorithm existed that would solve the problems in the NP class in polynomial time then P would equal NP. However, no one has yet been able to create that algorithm or to successfully prove that such an algorithm cannot exist. The algorithm that will be presented in this paper runs in polynomial time and solves the 3-satisfiability or 3-SAT problem, which has been proven to be NP-complete, thus indicating that P = NP.

Affiliated with

Also associated with

No associations

Rating

Algorithm that Solves 3-SAT in Polynomial Time 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 Algorithm that Solves 3-SAT in Polynomial Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm that Solves 3-SAT in Polynomial Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-182435