Standard

Worst-case upper bounds. / Dantsin, Evgeny; Hirsch, Edward A.

Handbook of Satisfiability. 1. ред. IOS Press, 2009. стр. 403-424 (Frontiers in Artificial Intelligence and Applications; Том 185, № 1).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › глава/раздел › научная › Рецензирование

Harvard

Dantsin, E & Hirsch, EA 2009, Worst-case upper bounds. в Handbook of Satisfiability. 1 изд., Frontiers in Artificial Intelligence and Applications, № 1, Том. 185, IOS Press, стр. 403-424. https://doi.org/10.3233/978-1-58603-929-5-403

APA

Dantsin, E., & Hirsch, E. A. (2009). Worst-case upper bounds. в Handbook of Satisfiability (1 ред., стр. 403-424). (Frontiers in Artificial Intelligence and Applications; Том 185, № 1). IOS Press. https://doi.org/10.3233/978-1-58603-929-5-403

Vancouver

Dantsin E, Hirsch EA. Worst-case upper bounds. в Handbook of Satisfiability. 1 ред. IOS Press. 2009. стр. 403-424. (Frontiers in Artificial Intelligence and Applications; 1). https://doi.org/10.3233/978-1-58603-929-5-403

Author

Dantsin, Evgeny ; Hirsch, Edward A. / Worst-case upper bounds. Handbook of Satisfiability. 1. ред. IOS Press, 2009. стр. 403-424 (Frontiers in Artificial Intelligence and Applications; 1).

BibTeX

@inbook{fb83d1c56ec440aea3c2b54f4a0bab97,
title = "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 = "2009",
month = jan,
day = "1",
doi = "10.3233/978-1-58603-929-5-403",
language = "English",
isbn = "9781586039295",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press",
number = "1",
pages = "403--424",
booktitle = "Handbook of Satisfiability",
address = "Netherlands",
edition = "1",

}

RIS

TY - CHAP

T1 - Worst-case upper bounds

AU - Dantsin, Evgeny

AU - Hirsch, Edward A.

PY - 2009/1/1

Y1 - 2009/1/1

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=72949104160&partnerID=8YFLogxK

U2 - 10.3233/978-1-58603-929-5-403

DO - 10.3233/978-1-58603-929-5-403

M3 - 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 -

ID: 49827781