On the Random Satisfiable Process
From MaRDI portal
Publication:3552504
DOI10.1017/S0963548309990356zbMath1214.68359arXiv0807.4326OpenAlexW2083392982MaRDI QIDQ3552504
Dan Vilenchik, Michael Krivelevich, Benjamin Sudakov
Publication date: 22 April 2010
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0807.4326
Related Items
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes, Random k -SAT and the power of two choices, The Kőnig graph process
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomly generated intersecting hypergraphs II
- Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems
- Sharp thresholds of graph properties, and the $k$-sat problem
- A Spectral Technique for Coloring Random 3-Colorable Graphs
- On the size of a random maximal graph
- Some optimal inapproximability results
- The random planar graph process