Go to the corresponding LIPIcs Volume Portal 
Bournez, Olivier ; Graça, Daniel S. ; Pouly, Amaury
pdfformat: 

@InProceedings{bournez_et_al:LIPIcs:2016:6244, author = {Olivier Bournez and Daniel S. Gra{\c{c}}a and Amaury Pouly}, title = {{Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {109:1109:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770132}, ISSN = {18688969}, year = {2016}, volume = {55}, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6244}, URN = {urn:nbn:de:0030drops62445}, doi = {10.4230/LIPIcs.ICALP.2016.109}, annote = {Keywords: Analog Models of Computation, ContinuousTime Models of Computation, Computable Analysis, Implicit Complexity, Computational Complexity, Ordinary Diff} }
Keywords:  Analog Models of Computation, ContinuousTime Models of Computation, Computable Analysis, Implicit Complexity, Computational Complexity, Ordinary Diff  
Seminar:  43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)  
Issue Date:  2016  
Date of publication:  17.08.2016 