Abstract: In this article I describe an efficient, randomized algorithm that finds a solution to the ONE-IN-THREE SAT problem (when one exists) in polynomial time with high probability.
Keywords: The Satisfiability Problem, ONE-IN-THREE SAT, Markov chain, random walk with absorbing barriers, NP-complete.
Title: AN EFFICIENT VERSION OF SCHONING’S ALGORITHM APPLIED FOR ONE-IN-THREE SAT
Author: Cristian Dumitrescu
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
