default search action

combined dblp search
author search
venue search
publication search

ask others

"Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121)."

Anna Gál et al. (2017)

> Home

Details and statistics

DOI: 10.4230/DAGREP.7.3.45

access: open

type: Informal or Other Publication

metadata version: 2020-07-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/GalK0T17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/GalK0T17
Anna Gál, Michal Koucký, Oded Regev, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121). Dagstuhl Reports 7(3): 45-69 (2017)

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.