de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

On Problems as Hard as CNF-SAT

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45687

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/11858/00-001M-0000-0014-BC08-3
Abstract
There is no abstract available