Jan 20, 2016 · We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations.
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations.
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class P of languages ...
Sep 23, 2016 · We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations.
An important point is that none of the classical methods for solving ordinary differential equations are polynomial time over unbounded time domains. Indeed ...
Jul 13, 2015 · Polynomial differential equations compute all real computable functions on computable compact intervals. 23(3):317–335. Shannon, C. E. (1941).
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length ... Published in Journal of the ACM 20 January 2016 ...
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version) · Olivier Bournez, Daniel S. Gracaa ...
Jan 21, 2016 · A summary of the paper: The authors show that any polynomial-time computable function (from the computable reals to the computable reals) ...
Missing: (Journal | Show results with:(Journal
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version). CoRR abs/1609.08059 (2016).