Title: How to solve kSAT in polynomial time

Authors: Algirdas Antano Maknickas

Addresses: Department of Information Technologies, Faculty of Fundamental Sciences, Vilnius Gediminas Technical University, Sauletekio al.11, Vilnius, Lithuania

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

Keywords: kSAT; linear programming; multi-valued logic; polynomial time algorithm; satisfiability.

DOI: 10.1504/IJOR.2015.069620

International Journal of Operational Research, 2015 Vol.23 No.3, pp.257 - 267

Received: 04 Dec 2012
Accepted: 14 Jul 2013
Published online: 29 May 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article