TL;DR
The paper introduces the clustered Sparrow algorithm, an extension of Schoning's 3SAT algorithm, with arguments suggesting it operates in polynomial time.
Contribution
It presents a novel extension of Schoning's 3SAT algorithm and provides strong theoretical arguments for its polynomial complexity.
Findings
Proposes the clustered Sparrow algorithm for 3SAT
Provides theoretical evidence for polynomial runtime
Extends Schoning's original algorithm
Abstract
In this paper, we study an extension of Schoning's algorithm [Schoning, 1991] for 3SAT, the clustered Sparrow algorithm We also present strong arguments that this algorithm is polynomial.
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.