Title: Hard and easy distributions of SAT problems
Abstract: 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.
Publication Year: 1992
Publication Date: 1992-07-12
Language: en
Type: article
Access and Citation
Cited By Count: 807
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot