Generating Hard Satisfiability Problems

  title={Generating Hard Satisfiability Problems},
  author={Bart Selman and David G. Mitchell and Hector J. Levesque},
  journal={Artif. Intell.},
We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult. Our results provide a benchmark for the evaluation of satisfiability-testing procedures. In… CONTINUE READING
Highly Influential
This paper has highly influenced 22 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 254 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS


Publications citing this paper.
Showing 1-10 of 158 extracted citations

255 Citations

Citations per Year
Semantic Scholar estimates that this publication has 255 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 35 references

Probabilistic analysis of algorithms for NP-complete problems

  • J. Franco
  • United States Air Force Annual Scientific Report,
  • 1986
Highly Influential
6 Excerpts

Evidence for a Satisfiability Threshold for Random 3CNF Formulas

  • T. Larrabee, Y. Tsuji
  • Proc. of the AAAI Spring Symposium on AI and NP…
  • 1993
3 Excerpts

Similar Papers

Loading similar papers…