The clustered Sparrow algorithm
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.
arXiv subjects
Publications and source records attributed to Cristian Dumitrescu.
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.
In this paper I present a 3SAT algorithm based on the randomized algorithm of Papadimitriou from 1991, and Schoning from 1991. We also present strong arguments that this algorithm finds a solution (if it exists) for a 3SAT problem with high probability in polynomial time.
We prove that Riemann's xi function is strictly increasing (respectively, strictly decreasing) in modulus along every horizontal half-line in any zero-free, open right (respectively, left) half-plane. A corollary is a reformulation of the Riemann Hypothesis.