An Improved Upper Bound for SAT

@article{Dantsin2005AnIU,
  title={An Improved Upper Bound for SAT},
  author={Evgeny Dantsin and Alexander Wolpert},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2005}
}
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1/α) up to a polynomial factor, where α = ln(m/n) + O(ln ln m) and n, m are respectively the number of variables and the number of clauses in the input formula. This bound is asymptotically better than the previously best known 2n(1−1/ log(2m)) bound for SAT. 
Highly Cited
This paper has 27 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
18 Citations
13 References
Similar Papers

Similar Papers

Loading similar papers…