Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains

DOI10.1007/978-3-642-22993-0_18zbMath1343.03035OpenAlexW2180340173MaRDI QIDQ3088037

Amaury Pouly, Daniel Silva Graça, Olivier Bournez

Publication date: 17 August 2011

Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computation over the reals, computable analysis (03D78)

Related Items (9)

Primitive recursive ordered fields and some applications ⋮ Exact real computation of solution operators for linear analytic systems of partial differential equations ⋮ Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Primitive recursive ordered fields and some applications ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Computability of Differential Equations ⋮ Bit-complexity of solving systems of linear evolutionary partial differential equations

This page was built for publication: Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains