DeepAI AI Chat
Log In Sign Up

A Linear Complementarity Theorem to solve any Satisfiability Problem in conjunctive normal form in polynomial time

by   Giacomo Patrizi, et al.

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any instance in this problem class, reduced to a LCP may be solved, provided certain necessary and sufficient conditions hold. The proof that these conditions will be satisfied for all problems in this class is the contribution of this paper and this derivation requires a nonlinear Instrumentalist methodology rather than a Realistic one and confirms the advantages of a Variational Inequalities implementation.


page 1

page 2

page 3

page 4


Complexity of the CNF-satisfiability problem

This paper is devoted to the complexity of the Boolean satisfiability pr...

Equation satisfiability in solvable groups

The study of the complexity of the equation satisfiability problem in fi...

Determining satisfiability of 3-SAT in polynomial time

In this paper, we provide a polynomial time (and space), algorithm that ...

Solving QSAT in sublinear depth

Among PSPACE-complete problems, QSAT, or quantified SAT, is one of the m...

Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time

One of the central applications for quantum annealers is to find the sol...

Necessary and sufficient conditions for Boolean satisfiability

The study in this article seeks to find conditions that are necessary an...