Method of resolution of 3SAT in polynomial time

2009/09/21 by Luigi Salemi, Salemi, Luigi
Computer Science · Engineering · #Optimization and Packing Problems #cs.CC

paper · pdf · doi:10.48550/arxiv.0909.3868

arxiv created 2010/09/13 · arxiv updated 2010/09/14

Abstract

Presentation of a Method for determining whether a problem 3Sat has solution, and if yes to find one, in time max O(n¹5). 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

Related

• Algorithm that Solves 3-SAT in Polynomial Time
• A Polynomial time Algorithm for 3SAT
• Determining satisfiability of 3-SAT in polynomial time
• A Polynomial Time Algorithm for 3-SAT
• A Critique of Du's "A Polynomial-Time Algorithm for 3-SAT