On problems as hard as CNF-SAT

Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström

Research output: Contribution to journalArticlepeer-review

50 Downloads (Pure)
Original languageEnglish
Article number41
JournalACM Transactions on Algorithms (TALG)
Volume12
Issue number3
DOIs
Publication statusPublished - 1 Jun 2016

Keywords

  • Optimal growth rate
  • Reduction
  • Satisfiability
  • Strong exponential time hypothesis

Cite this