Complexity of approximation problems

Authors

  • N. P. Korneichuk

Abstract

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.

Downloads

Published

25.12.1996

Issue

Vol. 48 No. 12 (1996)

Section

Research articles

How to Cite

Korneichuk, N. P. “Complexity of Approximation Problems”. Ukrains’kyi Matematychnyi Zhurnal, vol. 48, no. 12, Dec. 1996, pp. 1683-94, https://umj.imath.kiev.ua/index.php/umj/article/view/5190.