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

Local TagsRelease HistoryDetailsSummary

On Problems as Hard as CNF-SAT

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-BC08-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0023-BFFC-B

Genre: Conference Paper

Latex : On Problems as Hard as {CNF-SAT}

Files

show Files

Locators

show

Creators

show

hide

Creators:
Cygan, Marek¹, Author
Dell, Holger¹, Author
Lokshtanov, Daniel¹, Author
Marx, Daniel¹, Author
Nederlof, Jesper¹, Author
Okamoto, Yoshio¹, Author
Paturi, Ramamohan¹, Author
Saurabh, Saket¹, Author
Wahlström, Magnus², Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 2012

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1109/CCC.2012.36
BibTex Citekey: DLMNOPSW2012
Other: Local-ID: 969957873EE5E29EC1257AD4004F2DE8-DLMNOPSW2012

Degree: -

Event

show

hide

Title: 27th Conference on Computational Complexity

Place of Event: Porto, Portugal

Start-/End Date: 2012-06-26 - 2012-06-29

Legal Case

show

Project information

show

Source 1

show

hide

Title: 2012 IEEE 27th Conference on Computational Complexity

Abbreviation : CCC 2012

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: Piscataway, NJ : IEEE

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 74 - 84 Identifier: ISBN: 978-1-4673-1663-7