TY - CHAP
T1 - Worst-case upper bounds
AU - Dantsin, Evgeny
AU - Hirsch, Edward A.
PY - 2009
Y1 - 2009
N2 - The chapter is a survey of ideas and techniques behind satisfiability algorithms with the currently best asymptotic upper bounds on the worst-case running time. The survey also includes related structural-complexity topics such as Schaefer's dichotomy theorem, reductions between various restricted cases of SAT, the exponential time hypothesis, etc.
AB - The chapter is a survey of ideas and techniques behind satisfiability algorithms with the currently best asymptotic upper bounds on the worst-case running time. The survey also includes related structural-complexity topics such as Schaefer's dichotomy theorem, reductions between various restricted cases of SAT, the exponential time hypothesis, etc.
UR - https://www.scopus.com/pages/publications/72949104160
U2 - 10.3233/978-1-58603-929-5-403
DO - 10.3233/978-1-58603-929-5-403
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???
AN - SCOPUS:72949104160
SN - 9781586039295
T3 - Frontiers in Artificial Intelligence and Applications
SP - 403
EP - 424
BT - Handbook of Satisfiability
PB - IOS Press
ER -