Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361). Brattka, V., Dzhafarov, D. D., Marcone, A., & Pauly, A., editors Technical Report 9, Dagstuhl, Germany, 2019.
Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361) [link]Paper  doi  bibtex   
@TECHREPORT{BDMP19,
  title = {{Measuring the Complexity of Computational Content: From Combinatorial
	Problems to Analysis (Dagstuhl Seminar 18361)}},
  year = {2019},
  number = {9},
  address = {Dagstuhl, Germany},
  annote = {Keywords: Computability and complexity in analysis, computations
	on real numbers, reducibilities, descriptive complexity, computational
	complexity, reverse and construtive analysis},
  doi = {10.4230/DagRep.8.9.1},
  editor = {Brattka, Vasco and Dzhafarov, Damir D. and Marcone, Alberto and Pauly,
	Arno},
  issn = {2192-5283},
  keywords = {team, wei},
  pages = {1--28},
  publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  series = {Dagstuhl Reports},
  url = {http://drops.dagstuhl.de/opus/volltexte/2019/10327},
  volume = {8}
}

Downloads: 0