"Measuring the Complexity of Computational Content: From Combinatorial ..."

Vasco Brattka et al. (2018)

> Home

Details and statistics

DOI: 10.4230/DAGREP.8.9.1

access: open

type: Informal or Other Publication

metadata version: 2019-03-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/BrattkaDMP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/BrattkaDMP18
Vasco Brattka, Damir D. Dzhafarov, Alberto Marcone, Arno Pauly:
Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361). Dagstuhl Reports 8(9): 1-28 (2018)

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.