How to solve kSAT in polynomial time

2012/03/23 by Algirdas Antano Maknickas, Maknickas, Algirdas Antano
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC

paper · pdf · doi:10.48550/arxiv.1203.6020

arxiv created 2012/03/31 · arxiv updated 2012/04/03

Abstract

With using of multi-nary logic analytic formulas proposition that "kSAT is in P and could be solved in O(n^3.5)" was proved

Related

• Method of resolution of 3SAT in polynomial time
• A Polynomial time Algorithm for 3SAT
• Polynomial time algorithm for 3-SAT. Examples of use
• Analysis of the postulates produced by Karp's Theorem
• Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on\n Finite Fields