Non-Interlaced SAT is in P
Computational Complexity
2019-03-26 v2
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.
Cite
@article{arxiv.1803.10574,
title = {Non-Interlaced SAT is in P},
author = {Dr Serge Burckel},
journal= {arXiv preprint arXiv:1803.10574},
year = {2019}
}
Comments
3 pages