@inbook{bac6d8884adb43e5930867d05fcf0df9,
title = "Worst-case upper bounds: Worst-case upper bounds",
abstract = "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.",
author = "Evgeny Dantsin and Hirsch, {Edward A.}",
note = "Publisher Copyright: {\textcopyright} 2021 The authors and IOS Press. All rights reserved.",
year = "2021",
month = may,
day = "5",
doi = "10.3233/FAIA200999",
language = "אנגלית",
isbn = "9781643681603",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "669--692",
editor = "Armin Biere and Marijn Heule and {Van Maaren}, Hans and Toby Walsh",
booktitle = "Handbook of Satisfiability",
address = "הולנד",
}