TL;DR
This paper introduces a polynomial-time algorithm for solving a specific class of SAT problems called non-interlaced formulas, which are generally NP-Complete, by leveraging graph and matrix techniques.
Contribution
It demonstrates that non-interlaced SAT instances can be solved efficiently, challenging the typical NP-Completeness of SAT.
Findings
Non-interlaced formulas are solvable in polynomial time.
Graph and matrix methods are effective for this class.
This work identifies a tractable subclass within SAT.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Logic, Reasoning, and Knowledge · Advanced Algebra and Logic