@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}
}

{"_id":"WWbMTRLbyqQiLDw29","bibbaseid":"brattka-dzhafarov-marcone-pauly-measuringthecomplexityofcomputationalcontentfromcombinatorialproblemstoanalysisdagstuhlseminar18361-2019","authorIDs":[],"bibdata":{"bibtype":"techreport","type":"techreport","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":[{"propositions":[],"lastnames":["Brattka"],"firstnames":["Vasco"],"suffixes":[]},{"propositions":[],"lastnames":["Dzhafarov"],"firstnames":["Damir","D."],"suffixes":[]},{"propositions":[],"lastnames":["Marcone"],"firstnames":["Alberto"],"suffixes":[]},{"propositions":[],"lastnames":["Pauly"],"firstnames":["Arno"],"suffixes":[]}],"issn":"2192-5283","keywords":"team, wei","pages":"1–28","publisher":"Schloss Dagstuhl–Leibniz-Zentrum für Informatik","series":"Dagstuhl Reports","url":"http://drops.dagstuhl.de/opus/volltexte/2019/10327","volume":"8","bibtex":"@TECHREPORT{BDMP19,\r\n title = {{Measuring the Complexity of Computational Content: From Combinatorial\r\n\tProblems to Analysis (Dagstuhl Seminar 18361)}},\r\n year = {2019},\r\n number = {9},\r\n address = {Dagstuhl, Germany},\r\n annote = {Keywords: Computability and complexity in analysis, computations\r\n\ton real numbers, reducibilities, descriptive complexity, computational\r\n\tcomplexity, reverse and construtive analysis},\r\n doi = {10.4230/DagRep.8.9.1},\r\n editor = {Brattka, Vasco and Dzhafarov, Damir D. and Marcone, Alberto and Pauly,\r\n\tArno},\r\n issn = {2192-5283},\r\n keywords = {team, wei},\r\n pages = {1--28},\r\n publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\\\"u}r Informatik},\r\n series = {Dagstuhl Reports},\r\n url = {http://drops.dagstuhl.de/opus/volltexte/2019/10327},\r\n volume = {8}\r\n}\r\n\r\n","editor_short":["Brattka, V.","Dzhafarov, D. D.","Marcone, A.","Pauly, A."],"key":"BDMP19","id":"BDMP19","bibbaseid":"brattka-dzhafarov-marcone-pauly-measuringthecomplexityofcomputationalcontentfromcombinatorialproblemstoanalysisdagstuhlseminar18361-2019","role":"editor","urls":{"Paper":"http://drops.dagstuhl.de/opus/volltexte/2019/10327"},"keyword":["team","wei"],"downloads":0},"bibtype":"techreport","biburl":"http://cca-net.de/publications/lit.bib","creationDate":"2019-09-11T13:29:36.061Z","downloads":0,"keywords":["team","wei"],"search_terms":["measuring","complexity","computational","content","combinatorial","problems","analysis","dagstuhl","seminar","18361"],"title":"Measuring the Complexity of Computational Content: From Combinatorial Problems to Analysis (Dagstuhl Seminar 18361)","year":2019,"dataSources":["t7rKiAbxugj4Agz8M"]}