A randomized, efficient algorithm for 3SAT
Data Structures and Algorithms
2018-01-03 v9
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.
Cite
@article{arxiv.1703.01905,
title = {A randomized, efficient algorithm for 3SAT},
author = {Cristian Dumitrescu},
journal= {arXiv preprint arXiv:1703.01905},
year = {2018}
}
Comments
17 pages