Computing power series in polynomial time (Q1102956)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing power series in polynomial time
scientific article

    Statements

    Computing power series in polynomial time (English)
    0 references
    0 references
    0 references
    1988
    0 references
    It is shown that if a real-valued function f is polynomial-time computable on [a,b], with \(a<0<b\), and is analytic at 0, then the Taylor coefficients of f at 0, as a sequence of real numbers, is polynomial-time computable. Here, the notion of polynomial-time computable real numbers and real functions is based on the formal definitions given by the authors [Theor. Comput. Sci. 20, 323-352 (1982; Zbl 0498.03047)].
    0 references
    complexity of real functions
    0 references
    power series
    0 references
    polynomial-time computable real functions
    0 references
    Taylor coefficients
    0 references
    polynomial-time computable real numbers
    0 references

    Identifiers