{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T22:32:43Z","timestamp":1649197963841},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,2,2]]},"abstract":"<jats:p>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\u2019s dichotomy theorem, reductions between various restricted cases of SAT, the exponential time hypothesis, etc.<\/jats:p>","DOI":"10.3233\/faia200999","type":"book-chapter","created":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T08:42:00Z","timestamp":1612773720000},"source":"Crossref","is-referenced-by-count":0,"title":["Chapter 16. Worst-Case Upper Bounds"],"prefix":"10.3233","author":[{"given":"Evgeny","family":"Dantsin","sequence":"first","affiliation":[]},{"given":"Edward A.","family":"Hirsch","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Handbook of Satisfiability"],"original-title":[],"link":[{"URL":"http:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA200999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T08:42:01Z","timestamp":1612773721000},"score":1,"resource":{"primary":{"URL":"http:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA200999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,2]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia200999","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"value":"0922-6389","type":"print"},{"value":"1879-8314","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,2]]}}}