Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
- 1 January 1996
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Tail bounds for occupancy and the satisfiability threshold conjectureRandom Structures & Algorithms, 1995
- Critical Behavior in the Satisfiability of Random Boolean ExpressionsScience, 1994
- The Maple HandbookPublished by Springer Nature ,1994
- Ten Lectures on the Probabilistic MethodPublished by Society for Industrial & Applied Mathematics (SIAM) ,1994
- Mick gets some (the odds are on his side) (satisfiability)Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Poisson approximation for large deviationsRandom Structures & Algorithms, 1990
- The harmonic mean formula for probabilities of unions: applications to sparse random graphsDiscrete Mathematics, 1989
- Many hard examples for resolutionJournal of the ACM, 1988
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1983