pdf-format: |
|
@Article{brattka_et_al:DR:2019:10327, author = {Vasco Brattka and Damir D. Dzhafarov and Alberto Marcone and Arno Pauly}, title = {{Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361)}}, pages = {1--28}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2019}, volume = {8}, number = {9}, editor = {Vasco Brattka and Damir D. Dzhafarov and Alberto Marcone and Arno Pauly}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10327}, URN = {urn:nbn:de:0030-drops-103270}, doi = {10.4230/DagRep.8.9.1}, annote = {Keywords: Computability and complexity in analysis, computations on real numbers, reducibilities, descriptive complexity, computational complexity, reverse and} }
Keywords: | Computability and complexity in analysis, computations on real numbers, reducibilities, descriptive complexity, computational complexity, reverse and | |
Seminar: | Dagstuhl Reports, Volume 8, Issue 9 | |
Issue date: | 2019 | |
Date of publication: | 20.03.2019 |