How to solve kSAT in polynomial time

DOI10.1504/IJOR.2015.069620MaRDI QIDQ2627596zbMATH OpenFDO

Authors Algirdas Antano Maknickas

Publication date 31 May 2017

Published in International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1203.6020

zbMATH Keywords

kSATlinear programmingmulti-valued logicpolynomial time algorithmsatisfiability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Boolean programming (90C09) Abstract computational complexity for mathematical programming problems (90C60)

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

Review text

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

This page was built for publication: How to solve kSAT in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2627596)