Non-Interlaced SAT is in P

03/27/2018

∙

We investigate the NP-Complete problem SAT and the geometry of its instances. For a particular type that we call non-interlaced formulae, we propose a polynomial time algorithm for their resolution using graphs and matrices.

READ FULL TEXT

Non-Interlaced SAT is in P

A Refutation of Guinea's "Understanding SAT is in P"

From Hall's Marriage Theorem to Boolean Satisfiability and Back

A Polynomial Time Algorithm for a NPC Problem

On efficiently solvable cases of Quantum k-SAT

The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability

Indistinguishable binomial decision tree of 3-SAT: Proof of class P is a proper subset of class NP

On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier

Non-Interlaced SAT is in P

Related Research

A Refutation of Guinea's "Understanding SAT is in P"

From Hall's Marriage Theorem to Boolean Satisfiability and Back

A Polynomial Time Algorithm for a NPC Problem

On efficiently solvable cases of Quantum k-SAT

The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability

Indistinguishable binomial decision tree of 3-SAT: Proof of class P is a proper subset of class NP

On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier