11 citations to https://www.mathnet.ru/rus/mzm2111
-
Anatolii S. Romanyuk, Serhii Ya. Yanchenko, “Estimates for the entropy numbers of the Nikol'skii–Besov classes of functions with mixed smoothness in the space of quasi‐continuous functions”, Mathematische Nachrichten, 296:6 (2023), 2575
-
Romanyuk A.S., Romanyuk V.S., “Estimation of Some Approximating Characteristics of the Classes of Periodic Functions of One and Many Variables”, Ukr. Math. J., 71:8 (2020), 1257–1272
-
Temlyakov V., “on the Entropy Numbers of the Mixed Smoothness Function Classes”, J. Approx. Theory, 217 (2017), 26–56
-
Romanyuk A.S., “Entropy Numbers and Widths For the Classes of Periodic Functions of Many Variables”, Ukr. Math. J., 68:10 (2017), 1620–1636
-
Romanyuk A.S., “Estimation of the Entropy Numbers and Kolmogorov Widths For the Nikol'Skii-Besov Classes of Periodic Functions of Many Variables”, Ukr. Math. J., 67:11 (2016), 1739–1757
-
Б. С. Кашин, В. Н. Темляков, “Об одной норме и аппроксимационных характеристиках классов функций многих переменных”, Теория функций, СМФН, 25, РУДН, М., 2007, 58–79 ; B. S. Kashin, V. N. Temlyakov, “On a Norm and Approximate Characteristics of Classes of Multivariable Functions”, Journal of Mathematical Sciences, 155:1 (2008), 57–80
-
Leviatan D. Temlyakov V., “Simultaneous Approximation By Greedy Algorithms”, Adv. Comput. Math., 25:1-3 (2006), 73–90
-
Temlyakov V.N., “Nonlinear methods of approximation”, Found. Comput. Math., 3:1 (2003), 33–107
-
Lutoborski A. Temlyakov V., “Vector Greedy Algorithms”, J. Complex., 19:4 (2003), 458–473
-
Temlyakov V., “Weak Greedy Algorithms”, Adv. Comput. Math., 12:2-3 (2000), 213–227