Title of article :
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon Original Research Article
Author/Authors :
John Franco ، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2005
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 :
Satisfiability , k-CNF , Threshold , Probabilistic analysis
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
