The scaling window of the 2-SAT transition

@article{Bollobs2001TheSW,
  title={The scaling window of the 2-SAT transition},
  author={B. Bollob{\'a}s and C. Borgs and J. Chayes and J. H. Kim and D. Wilson},
  journal={Random Struct. Algorithms},
  year={2001},
  volume={18},
  pages={201-256}
}
We consider the random 2-satisfiability (2-SAT) problem, in which each instance is a formula that is the conjunction of m clauses of the form x∨y, chosen uniformly at random from among all 2-clauses on n Boolean variables and their negations. As m and n tend to infinity in the ratio m/nα, the problem is known to have a phase transition at αc=1, below which the probability that the formula is satisfiable tends to one and above which it tends to zero. We determine the finite-size scaling about… Expand
197 Citations
On the critical exponents of random k-SAT
  • D. Wilson
  • Mathematics, Computer Science
  • Random Struct. Algorithms
  • 2002
  • 20
  • PDF
Exact location of the phase transition for random (1, 2)-QSAT
  • 3
Random 2-XORSAT at the Satisfiability Threshold
  • 14
Random 2 XORSAT Phase Transition
  • 13
Random 2 XORSAT Phase Transition
  • 12
  • PDF
An Empirical Study of MAX-2-SAT Phase Transitions
  • H. Shen, H. Zhang
  • Mathematics, Computer Science
  • Electron. Notes Discret. Math.
  • 2003
  • 13
  • PDF
Random 2-SAT: results and problems
  • W. Vega
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2001
  • 35
Branching Process Approach for 2-Sat Thresholds
  • 2
  • PDF
A sharp threshold in proof complexity yields lower bounds for satisfiability search
  • 41
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 109 REFERENCES
Mick gets some (the odds are on his side) (satisfiability)
  • V. Chvátal, B. Reed
  • Mathematics, Computer Science
  • Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
  • 358
  • PDF
A Threshold for Unsatisfiability
  • 184
  • PDF
Approximating the unsatisfiability threshold of random formulas
  • 98
  • PDF
A Remark on Random 2-SAT
  • A. Goerdt
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1999
  • 9
Bounding the unsatisfiability threshold of random 3-SAT
  • 59
  • PDF
Statistical Mechanics of the K--Satisfiability Model
  • 73
  • PDF
Optimal myopic algorithms for random 3-SAT
  • D. Achlioptas, G. Sorkin
  • Mathematics, Computer Science
  • Proceedings 41st Annual Symposium on Foundations of Computer Science
  • 2000
  • 108
  • PDF
Critical Behavior in the Computational Cost of Satisfiability Testing
  • 108
  • PDF
...
1
2
3
4
5
...