Method of resolution of 3SAT in polynomial time

Details Method of resolution of 3SAT in polynomial time Method of resolution of 3SAT in polynomial time

2009-09-21

arxiv.org/abs/0909.3868v2

Computer Science

Computational Complexity

Scientific paper

Presentation of a Method for determining whether a problem 3Sat has solution, and if yes to find one, in time max O(n^15). Is thus proved that the problem 3Sat is fully resolved in polynomial time and therefore that it is in P, by the work of Cook and Levin, and can transform a SAT problem in a 3Sat in polynomial time (ref. Karp), it follows that P = NP. Open Source program is available at http://www.visainformatica.it/3sat

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-300067