Worst-case upper bounds: Worst-case upper bounds

Evgeny Dantsin; Edward A. Hirsch

doi:10.3233/FAIA200999

Worst-case upper bounds: Worst-case upper bounds

Evgeny Dantsin, Edward A. Hirsch

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

2 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 language	English
Title of host publication	Handbook of Satisfiability
Subtitle of host publication	Second Edition. Part 1/Part 2
Editors	Armin Biere, Marijn Heule, Hans Van Maaren, Toby Walsh
Publisher	IOS Press BV
Pages	669-692
Number of pages	24
ISBN (Electronic)	9781643681610
ISBN (Print)	9781643681603
DOIs	https://doi.org/10.3233/FAIA200999
State	Published - 5 May 2021
Externally published	Yes

Publication series

Name	Frontiers in Artificial Intelligence and Applications
Volume	336
ISSN (Print)	0922-6389

Access to Document

10.3233/FAIA200999

Cite this

@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.}",

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 = "הולנד",

}

Worst-case upper bounds: Worst-case upper bounds. / Dantsin, Evgeny; Hirsch, Edward A.
Handbook of Satisfiability: Second Edition. Part 1/Part 2. ed. / Armin Biere; Marijn Heule; Hans Van Maaren; Toby Walsh. IOS Press BV, 2021. p. 669-692 (Frontiers in Artificial Intelligence and Applications; Vol. 336).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Worst-case upper bounds

T2 - Worst-case upper bounds

AU - Dantsin, Evgeny

AU - Hirsch, Edward A.

PY - 2021/5/5

Y1 - 2021/5/5

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 - http://www.scopus.com/inward/record.url?scp=85109059884&partnerID=8YFLogxK

U2 - 10.3233/FAIA200999

DO - 10.3233/FAIA200999

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

AN - SCOPUS:85101492913

SN - 9781643681603

T3 - Frontiers in Artificial Intelligence and Applications

SP - 669

EP - 692

BT - Handbook of Satisfiability

A2 - Biere, Armin

A2 - Heule, Marijn

A2 - Van Maaren, Hans

A2 - Walsh, Toby

PB - IOS Press BV

ER -

Worst-case upper bounds: Worst-case upper bounds

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this