"Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time ..."

Thore Husfeldt et al. (2013)

> Home

Details and statistics

DOI: 10.4230/DAGREP.3.8.40

access: open

type: Informal or Other Publication

metadata version: 2017-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/HusfeldtPSW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/HusfeldtPSW13
Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams:
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Dagstuhl Reports 3(8): 40-72 (2013)

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.