Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

DOI10.1145/3127496zbMATH Open1426.68088arXiv1601.05360OpenAlexW2963290555MaRDI QIDQ4640346FDOQ4640346

Authors: Amaury Pouly, Olivier Bournez, Daniel Graça 

Publication date: 17 May 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Abstract: We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $operatornamePTIME$ of languages computable in polynomial time in terms of differential equations with polynomial right-hand side. This result gives a purely continuous (time and space) elegant and simple characterization of $operatornamePTIME$. This is the first time such classes are characterized using only ordinary differential equations. Our characterization extends to functions computable in polynomial time over the reals in the sense of computable analysis. This extends to deterministic complexity classes above polynomial time. This may provide a new perspective on classical complexity, by giving a way to define complexity classes, like $operatornamePTIME$, in a very simple way, without any reference to a notion of (discrete) machine. This may also provide ways to state classical questions about computational complexity via ordinary differential equations, i.e.~by using the framework of analysis.

Full work available at URL: https://arxiv.org/abs/1601.05360

Recommendations

• 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
• Polynomial solutions of a certain class of ordinary differential equations
• Characterizing time computational complexity classes with polynomial differential equations
• Polynomial solutions of certain classes of ordinary differential equations
• Polynomial solutions of differential-difference equations
• Polynomial solutions of certain differential equations
• Polynomial-time solution of initial value problems using polynomial enclosures
• scientific article; zbMATH DE number 2064551
• Polynomial solutions of differential equations
• On polynomial solutions of differential equations

zbMATH Keywords

computational complexitycomputable analysisordinary differential equationsimplicit complexityanalog models of computationcontinuous-time models of computation

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Nonlinear ordinary differential equations and systems (34A34) Other nonclassical models of computation (68Q09) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (16)

• A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations
• Programming with ordinary differential equations: some first steps towards a programming language
• \textit{CRN}++: molecular programming language
• Characterizing time computational complexity classes with polynomial differential equations
• A Survey on Analog Models of Computation
• A universal ordinary differential equation
• Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
• Computing with polynomial ordinary differential equations
• A convenient expression of the time-derivative zn(k)(t) , of arbitrary order k, of the zero z _n (t) of a time-dependent polynomial p _N (z;t) of arbitrary degree N in z, and solvable dynamical systems
• Computability with polynomial differential equations
• 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
• Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
• Robust real-time computing with chemical reaction networks
• A continuous characterization of PSPACE using polynomial ordinary differential equations
• On the stability of nucleic acid feedback control systems
• A theory of complexity for continuous time systems

This page was built for publication: Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4640346)