Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6876224 | Theoretical Computer Science | 2014 | 26 Pages |
Abstract
We propose an algorithm for 3-iSAT, and analyze it on uniformly random formulas. The algorithm follows the Unit Clause paradigm, enhanced by a (very limited) backtracking option. Using Wormaldʼs ODE method, we prove that, if m/n⩽2.3, with high probability, our algorithm succeeds in finding an assignment of values to the variables satisfying the formula.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Kathrin Ballerstein, Dirk Oliver Theis,