|
|||||
|
|
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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |