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.
Saved in:
| Date: | 1996 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | Russian English |
| Published: |
Institute of Mathematics, NAS of Ukraine
1996
|
| Online Access: | https://umj.imath.kiev.ua/index.php/umj/article/view/5190 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Ukrains’kyi Matematychnyi Zhurnal |
| Download file: |  |
Institution
Ukrains’kyi Matematychnyi Zhurnal| Summary: | 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. |
|---|