Worst-case upper bounds: Worst-case upper bounds

Evgeny Dantsin, Edward A. Hirsch

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

1 Scopus citations

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.

Original languageEnglish
Title of host publicationHandbook of Satisfiability
Subtitle of host publicationSecond Edition. Part 1/Part 2
EditorsArmin Biere, Marijn Heule, Hans Van Maaren, Toby Walsh
PublisherIOS Press BV
Pages669-692
Number of pages24
ISBN (Electronic)9781643681610
ISBN (Print)9781643681603
DOIs
StatePublished - 5 May 2021
Externally publishedYes

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume336
ISSN (Print)0922-6389

Fingerprint

Dive into the research topics of 'Worst-case upper bounds: Worst-case upper bounds'. Together they form a unique fingerprint.

Cite this