default search action

combined dblp search
author search
venue search
publication search

ask others

"Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010"

Thore Husfeldt et al. (2010)

> Home

Details and statistics

DOI: —

access: open

type: Editorship

metadata version: 2021-06-10

- view
  - table of contents in dblp
  - electronic edition @ dagstuhl.de (open access)
- export record
  dblp key:
  - conf/dagstuhl/2010P10441
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2010P10441
Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010. Dagstuhl Seminar Proceedings 10441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents]

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.