|
This article is cited in 2 scientific papers (total in 2 papers)
Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay
A. N. Cherepov
Abstract:
We consider determinate functions with delay which are generalisations of determinate functions and introduce the notion of complexity of an $\varepsilon$-approximation of a continuous real function by a function with delay. For some classes of continuous functions for which estimates of the number of elements in the $2\varepsilon$-distinguishable set of functions are known, upper and lower estimates are obtained.
Received: 28.11.2007
Citation:
A. N. Cherepov, “Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay”, Diskr. Mat., 20:4 (2008), 147–156; Discrete Math. Appl., 18:6 (2008), 631–640
Linking options:
https://www.mathnet.ru/eng/dm1034https://doi.org/10.4213/dm1034 https://www.mathnet.ru/eng/dm/v20/i4/p147
|
|