Results related to threshold phenomena research in satisfiability: lower bounds
- 20 August 2001
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 265 (1-2) , 147-157
- https://doi.org/10.1016/s0304-3975(01)00158-x
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Lower bounds for random 3-SAT via differential equationsTheoretical Computer Science, 2001
- Random constraint satisfaction: A more accurate picturePublished by Springer Nature ,1997
- Analysis of Two Simple Heuristics on a Random Instance ofk-satJournal of Algorithms, 1996
- Phase transitions and the search problemArtificial Intelligence, 1996
- Generating hard satisfiability problemsArtificial Intelligence, 1996
- Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problemInformation Sciences, 1990
- Probabilistic performance of a heuristic for the satisfiability problemDiscrete Applied Mathematics, 1988
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1983
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960