Non-Interlaced SAT is in P

03/27/2018

∙

by   Dr Serge Burckel, et al.

∙

0

∙

share

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.