A randomized, efficient algorithm for 3SAT
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2017
- DOI:
- 10.48550/arXiv.1703.01905
- arXiv:
- arXiv:1703.01905
- Bibcode:
- 2017arXiv170301905D
- Keywords:
-
- Computer Science - Data Structures and Algorithms
- E-Print:
- 17 pages