Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Pushing Random Walk Beyond Golden Ratio
verfasst von : Ehsan Amiri, Evgeny Skvortsov
Erschienen in: Computer Science – Theory and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. We rigorously prove that the new algorithm solves the Full CNF with high probability, and for random CNFs with a planted solution of high density finds an assignment that differs from the planted in only
ε
-fraction of variables. In the experiments the algorithm solves random CNFs with a planted solution of any density.