On the probabilistic approach to the random satisfiability problem

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

Abstract

In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic. In the case of the random 3-satisfiability problem a phase transition from the satisfiable to the unsatisfiable phase is found at α = 4.267. There are other values of a that separates different regimes and they will be described in details. In this context the properties of the survey decimation algorithm will also be discussed.

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
Pages203-213
Number of pages11
ISBN (Print)3540208518
DOIs
StatePublished - 2004
Externally publishedYes

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 'On the probabilistic approach to the random satisfiability problem'. Together they form a unique fingerprint.

Cite this