Uniform computational complexity of Taylor series

Müller, Norbert Theodor

The close connection between an analytic real function and its Taylor series is studied in terms of computational complexity. As central result, the function is computable in polynomial time if and only if the coefficients of the series are uniformly computable in polynomial time. In consequence, integration and analytic continuation of polynomial time computable analytic functions again lead to polynomial time computable functions.

Vorschau

Zitieren

Zitierform:

Müller, Norbert: Uniform computational complexity of Taylor series. Hagen 1987. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe