On problems as hard as CNF-SAT

M. Cygan, H. Dell, D. Lokshtanov, D. Marx, J. Nederlof, Y. Okamoto, R. Paturi, S. Saurabh, M. Wahlström

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

66 Citations (Scopus)
1 Downloads (Pure)


The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. While exhaustive search remains asymptotically the fastest known algorithm for some basic problems, difficult and non-trivial exponential time algorithms have been found for a myriad of problems, including Graph Coloring, Hamiltonian Path, Dominating Set and 3-CNF-Sat. In some instances, improving these algorithms further seems to be out of reach. The CNF-Sat problem is the canonical example of a problem for which the trivial exhaustive search algorithm runs in time O(2^n), where n is the number of variables in the input formula. While there exist non-trivial algorithms for CNF-Sat that run in time o(2^n), no algorithm was able to improve the growth rate 2 to a smaller constant, and hence it is natural to conjecture that 2 is the optimal growth rate. The strong exponential time hypothesis (SETH) by Impagliazzo and Paturi [JCSS 2001] goes a little bit further and asserts that, for every epsilon
Original languageEnglish
Title of host publication27th Conference on Computational Complexity (CCC'12, Porto, Portugal, June 26-29, 2012)
Place of PublicationWashington D.C.
PublisherIEEE Computer Society
ISBN (Print)978-0-7695-4708-4
Publication statusPublished - 2012
Externally publishedYes
Eventconference; 27th Conference on Computational Complexity -
Duration: 1 Jan 2012 → …


Conferenceconference; 27th Conference on Computational Complexity
Period1/01/12 → …
Other27th Conference on Computational Complexity


Dive into the research topics of 'On problems as hard as CNF-SAT'. Together they form a unique fingerprint.

Cite this