@article{6c0cd3d6381c4573a85230be1cf79788,
title = "On problems as hard as CNF-SAT",
keywords = "Optimal growth rate, Reduction, Satisfiability, Strong exponential time hypothesis",
author = "Marek Cygan and Holger Dell and Daniel Lokshtanov and D{\'a}niel Marx and Jesper Nederlof and Yoshio Okamoto and Ramamohan Paturi and Saket Saurabh and Magnus Wahlstr{\"o}m",
year = "2016",
month = jun,
day = "1",
doi = "10.1145/2925416",
language = "English",
volume = "12",
journal = "ACM Transactions on Algorithms (TALG)",
issn = "1549-6325",
publisher = "Association for Computing Machinery (ACM)",
number = "3",
}