On Problems as Hard as CNF-SAT

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

doi:10.1109/CCC.2012.36

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On Problems as Hard as CNF-SAT

MPS-Authors

/persons/resource/persons45687

Wahlström, Magnus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Cygan, M., Dell, H., Lokshtanov, D., Marx, D., Nederlof, J., Okamoto, Y., et al. (2012). On Problems as Hard as CNF-SAT. In 2012 IEEE 27th Conference on Computational Complexity (pp. 74-84). Piscataway, NJ: IEEE.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-BC08-3

Abstract

There is no abstract available