Article ID Journal Published Year Pages File Type
9655102 Discrete Applied Mathematics 2005 35 Pages PDF
Abstract
This is a written record of a survey talk on the topic of typical case complexity of Satisfiability algorithms which was presented at the LICS workshop on this subject in June, 2003, Ottawa, Canada.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Authors
,