Abstract
The performances of a local search procedure, the Pure Random Walk (PRW), for the satisfiability (SAT) problem is investigated with statistical physics methods. We identify and characterize a dynamical transition for the behavior of PRW algorithm on randomly drawn SAT instances where, as the ratio of clauses to variables is increased, the scaling of the solving time changes from being linear to exponential in the input size. A framework for calculating relevant quantities in the linear phase, in particular the average solving time, is introduced, along with an approximate study of the exponential phase. © Springer-Verlag 2004.
Cite
CITATION STYLE
Semerjian, G., & Monasson, R. (2004). A study of pure random walk on random satisfiability problems with “Physical” methods. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2919, 120–134. https://doi.org/10.1007/978-3-540-24605-3_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
