Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computational Complexity

arXiv:cs/0308010 (cs)
[Submitted on 5 Aug 2003]

Title:On the probabilistic approach to the random satisfiability problem

Authors:Giorgio Parisi
View PDF
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 $\alpha=4.267$. There are other values of $\alpha$ 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.
Comments: 11 pages, proceedings of SAT 2003
Subjects: Computational Complexity (cs.CC); Disordered Systems and Neural Networks (cond-mat.dis-nn)
ACM classes: G.3, G.2.1 G.3, G.2.1 G.3, G.2.1
Cite as: arXiv:cs/0308010 [cs.CC]
  (or arXiv:cs/0308010v1 [cs.CC] for this version)
  https://doi.org/10.48550/arXiv.cs/0308010

Submission history

From: Giorgio Parisi [view email]
[v1] Tue, 5 Aug 2003 10:34:36 UTC (22 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.CC
< prev   |   next >
new | recent | 2003-08

References & Citations

DBLP - CS Bibliography

listing | bibtex
Giorgio Parisi
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)