Non-Interlaced SAT is in P
arXiv:1803.10574
Abstract
We investigate the NP-Complete problem SAT and the geometry of its instances. For a particular type that we call {\it non-interlaced formulas}, we propose a polynomial time algorithm for their resolution using graphs and matrices.
3 pages