Complexity of approximation problems
We consider some aspects of optimal encoding and renewal related to the problem of complexity of the ε-definition of functions posed by Kolmogorov in 1962. We present some estimates for the ε-complexity of the problem of renewal of functions in the uniform metric and Hausdorff metric.
English version (Springer): Ukrainian Mathematical Journal 48 (1996), no. 12, pp 1904-1915.
Citation Example: Korneichuk N. P. Complexity of approximation problems // Ukr. Mat. Zh. - 1996. - 48, № 12. - pp. 1683-1694.