Cygan, Marek ; Fomin, Fedor V. ; Kowalik, Łukasz ; Lokshtanov, Daniel ; Marx, Dániel ; Pilipczuk, Marcin ; Pilipczuk, Michał ; Saurabh, Saket (2011) Lower bounds based on the Exponential Time Hypothesis EATCS Bulletin, 105 . pp. 41-71.
Full text not available from this repository.
Official URL: http://doi.org/10.1007/978-3-319-21275-3_14
Abstract
In this article we survey algorithmic lower bound results that have been obtained in the field of exact exponential time algorithms and parameterized complexity under certain assumptions on the running time of algorithms solving CNF-Sat, namely Exponential time hypothesis (ETH) and Strong Exponential time hypothesis (SETH).
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to European Association for Theoretical Computer Science. |
| ID Code: | 123459 |
| Deposited On: | 20 Sep 2021 08:14 |
| Last Modified: | 20 Sep 2021 08:14 |
Repository Staff Only: item control page
