Anzeige
Erschienen in:
1987 | ReviewPaper | Buchkapitel
Uniform computational complexity of Taylor series
verfasst von : N.Th. Müller
Erschienen in: Automata, Languages and Programming
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.