On the Greedy Algorithm for Satisfiability (1992)
by
Elias Koutsoupias
,
Christos H. Papadimitriou
| Venue: | INFORMATION PROCESSING LETTERS |
| Citations: | 27 - 0 self |
BibTeX
@ARTICLE{Koutsoupias92onthe,
author = {Elias Koutsoupias and Christos H. Papadimitriou},
title = {On the Greedy Algorithm for Satisfiability},
journal = {INFORMATION PROCESSING LETTERS},
year = {1992},
volume = {43},
pages = {53--55}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that for the vast majority of satisfiable 3CNF formulae, the local search heuristic that starts at a random truth assignment, and repeatedly flips the variable that improves the number of satisfied clauses the most, almost always succeeds in discovering a satisfying truth assignment.
Citations
| 8879 | Computers and Intractability: A guide to the Theory of NP-Completeness - Garey, Johnson - 1979 |
| 190 | A guided tour of Chernoff bounds - Hagerup, Rub - 1990 |
