Non-Interlaced SAT is in P
Abstract
We investigate the NP-Complete problem SAT and the geometry of its instances. For a particular type that we call non-interlaced formulas, we propose a polynomial time algorithm for their resolution using graphs and matrices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.