How to solve kSAT in polynomial time

Algirdas Antano Maknickas

International Journal of Operational Research, 2015, vol. 23, issue 3, 257-267

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. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=69620 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:23:y:2015:i:3:p:257-267

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().