Complexity of functions: Some questions, conjectures, and results (Q1174450)

From MaRDI portal
Revision as of 21:35, 26 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q123007983, #quickstatements; #temporary_batch_1706301185450)
scientific article
Language Label Description Also known as
English
Complexity of functions: Some questions, conjectures, and results
scientific article

    Statements

    Complexity of functions: Some questions, conjectures, and results (English)
    0 references
    0 references
    25 June 1992
    0 references
    The author proposes a new approach to the problem of complexity of functions evaluation, storage and memorating based on piecewise polynomial approximation. He compares his approach with others (Shannon, Kolmogorov, Vitushkin, Kiefer, Backvalov etc, and formulates some interesting conjectures. The paper contains also a review of previous results and formulation of some author's new results.
    0 references
    0 references
    piecewise polynomial approximation
    0 references

    Identifiers