Publication:3788007
From MaRDI portal
zbMath0645.03060MaRDI QIDQ3788007
Publication date: 1987
integrationTaylor seriesanalytic continuationanalytic real functionconstructive analysispolynomial time computable functionspolynomial time computable analytic functions
Analysis of algorithms and problem complexity (68Q25) Constructive and recursive analysis (03F60) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
The complexity of divisibility, Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems, Computing the exact number of periodic orbits for planar flows, On the computational complexity of the Dirichlet Problem for Poisson's Equation, Average-case polynomial-time computability of hamiltonian dynamics, On the complexity of online computations of real functions, Lower Bounds on the Continuation of Holomorphic Functions, Type 2 computational complexity of functions on Cantor's space, Computability on computable metric spaces, A refined model of computation for continuous problems, Representations and evaluation strategies for feasibly approximable functions, Computability of Differential Equations