Complexity of functions: Some questions, conjectures, and results (Q1174450)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8730
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of functions: Some questions, conjectures, and results |
scientific article; zbMATH DE number 8730 |
Statements
Complexity of functions: Some questions, conjectures, and results (English)
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
piecewise polynomial approximation
0 references
0 references
0 references
0 references
0 references
0.7726707458496094
0 references
0.7550348043441772
0 references
