Mick gets some (the odds are on his side) (satisfiability)

@article{Chvtal1992MickGS,
  title={Mick gets some (the odds are on his side) (satisfiability)},
  author={V. Chv{\'a}tal and B. Reed},
  journal={Proceedings., 33rd Annual Symposium on Foundations of Computer Science},
  year={1992},
  pages={620-627}
}
  • V. Chvátal, B. Reed
  • Published 1992
  • Mathematics, Computer Science
  • Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • Consider a randomly generated boolean formula F (in the conjunctive normal form) with m clauses of size k over n variables; k is fixed at any value greater than 1, but n tends to infinity and m = (1 + o(1))cn for some c depending only on k. It is easy to see that F is unsatisfiable with probability 1-o(1) whenever c>(ln 2)2/sup k/; the authors complement this observation by proving that F is satisfiable with probability 1-o(1) whenever c<(0.25)2/sup k//k; in fact, they present a linear-time… CONTINUE READING
    357 Citations

    Topics from this paper

    On the critical exponents of random k-SAT
    • D. Wilson
    • Mathematics, Computer Science
    • Random Struct. Algorithms
    • 2002
    • 20
    • Highly Influenced
    • PDF
    A Threshold for Unsatisfiability
    • 70
    Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
    • E. Shamir
    • Mathematics, Computer Science
    • Log. J. IGPL
    • 2006
    • PDF
    The Threshold for Random kSAT is 2 k ( ln 2 + o ( 1 ) )
    • 34
    Thresholds of Random kSat ( 2002 ; Kaporis , Kirousis , Lalas )
    • PDF
    Random 2-XORSAT at the Satisfiability Threshold
    • 14
    The scaling window of the 2-SAT transition
    • 195
    • PDF
    A sharp threshold in proof complexity yields lower bounds for satisfiability search
    • 41
    • PDF
    Delaying satisfiability for random 2SAT
    • 3
    • PDF

    References

    SHOWING 1-7 OF 7 REFERENCES
    A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas
    • 912
    • PDF
    Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
    • 236
    The complexity of theorem-proving procedures
    • S. Cook
    • Mathematics, Computer Science
    • STOC '71
    • 1971
    • 6,152
    • PDF
    Many hard examples for resolution
    • 489
    • PDF
    On the Complexity of Timetable and Multicommodity Flow Problems
    • 1,076
    • PDF
    ktude statistisque de l ' existence de solutions de probkmee SAT , application aux systhmes - experts
    • Acad . Sci . Paris . Skr . I Math .