On Random 3-sat
From MaRDI portal
Publication:4862742
DOI10.1017/S0963548300001590zbMath0840.68051OpenAlexW2151140339MaRDI QIDQ4862742
A. El Maftouhi, Wenceslas Fernandez de la Vega
Publication date: 1 July 1996
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548300001590
Related Items
Sharp thresholds of graph properties, and the $k$-sat problem, On threshold properties of \(k\)-SAT: An additive viewpoint, On good algorithms for determining unsatisfiability of propositional formulas, The scaling window of the 2-SAT transition, Rigorous results for random (\(2+p)\)-SAT, Upper bounds on the satisfiability threshold, Typical case complexity of satisfiability algorithms and the threshold phenomenon, Selecting Complementary Pairs of Literals
Cites Work
