On Problems as Hard as CNF-SAT. / Cygan, Marek; Dell, Holger; Lokshtanov, Daniel; Marx, Dániel; Nederlof, Jesper; Okamoto, Yoshio; Paturi, Ramamohan; Saurabh, Saket; Wahlström, Magnus.

IEEE Conference on Computational Complexity. 2012. p. 74-84.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Published
  • Marek Cygan
  • Holger Dell
  • Daniel Lokshtanov
  • Dániel Marx
  • Jesper Nederlof
  • Yoshio Okamoto
  • Ramamohan Paturi
  • Saket Saurabh
  • Magnus Wahlström
Original languageUndefined/Unknown
Title of host publicationIEEE Conference on Computational Complexity
Pages74-84
Number of pages11
Publication statusPublished - 2012

ID: 16830707