DSApr 10
The clustered Sparrow algorithm
arXiv:1804.1118131.8h-index: 7
AI Analysis
This addresses the computational complexity of SAT-solving for theoretical computer science, but appears incremental as it builds on an existing method.
The paper tackles the problem of solving 3SAT by extending Schoning's algorithm with the clustered Sparrow algorithm, and it presents arguments suggesting that this algorithm is polynomial.
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.