Skip to main navigation Skip to search Skip to main content

A study of pure random walk on random satisfiability problems with "Physical" methods

  • Centre national de la recherche scientifique

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsEnrico Giunchiglia, Armando Tacchella
PublisherSpringer Verlag
Pages120-134
Number of pages15
ISBN (Print)3540208518
DOIs
Publication statusPublished - 1 Jan 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2919
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'A study of pure random walk on random satisfiability problems with "Physical" methods'. Together they form a unique fingerprint.

Cite this