Generating hard satisfiability problems
- 1 March 1996
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 81 (1-2) , 17-29
- https://doi.org/10.1016/0004-3702(95)00045-3
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Critical behavior in the computational cost of satisfiability testingArtificial Intelligence, 1996
- Some pitfalls for experimenters with random SATArtificial Intelligence, 1996
- Easy problems are sometimes hardArtificial Intelligence, 1994
- Critical Behavior in the Satisfiability of Random Boolean ExpressionsScience, 1994
- Many hard examples for resolutionJournal of the ACM, 1988
- Resolution vs. cutting plane solution of inference problems: Some computational experienceOperations Research Letters, 1988
- The intractability of resolutionTheoretical Computer Science, 1985
- Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problemDiscrete Applied Mathematics, 1983
- On the complexity of regular resolution and the Davis-Putnam procedureTheoretical Computer Science, 1977
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960