Computing power series in polynomial time

DOI10.1016/0196-8858(88)90006-1zbMath0645.03059OpenAlexW1984495709MaRDI QIDQ1102956

Harvey M. Friedman, Ker-I. Ko

Publication date: 1988

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(88)90006-1

zbMATH Keywords

power seriesTaylor coefficientspolynomial-time computable real functionscomplexity of real functionspolynomial-time computable real numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Constructive and recursive analysis (03F60) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (6)

On parallel complexity of analytic functions ⋮ Average-case polynomial-time computability of hamiltonian dynamics ⋮ Lower Bounds on the Continuation of Holomorphic Functions ⋮ On subrecursive complexity of integration ⋮ Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval ⋮ Computability of Differential Equations

Cites Work

• Unnamed Item
• Unnamed Item
• The computational complexity of maximization and integration
• The maximum value problem and NP real numbers
• Computational complexity of real functions
• Computability and Noncomputability in Classical Analysis
• Some negative results on the computational complexity of total variation and differentiation

This page was built for publication: Computing power series in polynomial time