Finding Hard Instances of the Satisfiability Problem: A Survey

Finding Hard Instances of the Satisfiability Problem: A Survey (1997)

by Stephen A. Cook , David G. Mitchell

Citations:

101 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Finding Hard Instances of the Satisfiability Problem: A Survey	INFERENCE
AUTHOR NAME	Stephen A. Cook	SVM HeaderParse 0.1
AUTHOR NAME	David G. Mitchell	SVM HeaderParse 0.1
ABSTRACT	. Finding sets of hard instances of propositional satisfiability is of interest for understanding the complexity of SAT, and for experimentally evaluating SAT algorithms. In discussing this we consider the performance of the most popular SAT algorithms on random problems, the theory of average case complexity, the threshold phenomenon, known lower bounds for certain classes of algorithms, and the problem of generating hard instances with solutions.	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	1--17	INFERENCE
VOLUME	35	INFERENCE
CITATIONS	74 found	ParsCit 1.0