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

Anna Gál, Rahul Santhanam, Till Tantau (2019)

> Home

Details and statistics

DOI: 10.4230/DAGREP.9.3.64

access: open

type: Informal or Other Publication

metadata version: 2019-09-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/GalST19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/GalST19
Anna Gál, Rahul Santhanam, Till Tantau:
Computational Complexity of Discrete Problems (Dagstuhl Seminar 19121). Dagstuhl Reports 9(3): 64-82 (2019)

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.