Passer à la navigation principale Passer à la recherche Passer au contenu principal

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

  • CNRS

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionChapitreRevue par des pairs

Résumé

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.

langue originaleAnglais
titreLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
rédacteurs en chefEnrico Giunchiglia, Armando Tacchella
EditeurSpringer Verlag
Pages120-134
Nombre de pages15
ISBN (imprimé)3540208518
Les DOIs
étatPublié - 1 janv. 2004

Série de publications

NomLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2919
ISSN (imprimé)0302-9743
ISSN (Electronique)1611-3349

Empreinte digitale

Examiner les sujets de recherche de « A study of pure random walk on random satisfiability problems with "Physical" methods ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation