Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version)
From MaRDI portal
Publication:4598250
DOI10.4230/LIPIcs.ICALP.2016.109zbMath1388.68041arXiv1609.08059OpenAlexW4301020871MaRDI QIDQ4598250
Amaury Pouly, Olivier Bournez, Daniel Silva Graça
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1609.08059
computational complexityordinary differential equationscomputable analysisimplicit complexityanalog models of computationcontinuous-time models of computation
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computation over the reals, computable analysis (03D78)
Related Items (5)
Characterizing time computational complexity classes with polynomial differential equations ⋮ Real-time computability of real numbers by chemical reaction networks ⋮ A continuous characterization of PSPACE using polynomial ordinary differential equations ⋮ A Universal Ordinary Differential Equation ⋮ A Survey on Analog Models of Computation
This page was built for publication: Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length (Journal version)
