Publications

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

AuthID
P-00M-FH4

Author(s)

Bournez, O

Graca, DS

Pouly, A

Editor(s)

Rabani Y.Chatzigiannakis I.Sangiorgi D.Mitzenmacher M.

Document Type

Proceedings Paper

Year published

2016

Published

in Leibniz International Proceedings in Informatics, LIPIcs, ISSN: 1868-8969

Volume: 55

Conference

43Rd International Colloquium on Automata, Languages, and Programming, Icalp 2016, Date: 12 July 2016 through 15 July 2016, Sponsors: AICA;Austrian;Facebook;Microsoft;Microsoft Research;Sapienza University of Rome, Department of Informatics

Indexing

Scopus^®

Google Scholar^®

Metadata
Sources

Publication Identifiers

DOI: 10.4230/lipics.icalp.2016.109

SCOPUS: 2-s2.0-85012887429

Source Identifiers

ISSN: 1868-8969

Export Publication Metadata

Marked List

Add to Marked List

Info

At this moment we don't have any links to full text documens.

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

Useful Links

Get Help

Federated Authentication (Click on the image)

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

Useful Links

Get Help