- Giorgio Gnecco, Marcello Sanguineti, “On a Variational Norm Tailored to Variable-Basis Approximation Schemes”, IEEE Trans. Inform. Theory, 57, № 1, 2011, 549
- A. V. Andrianov, “Approximation ofMH q r -class functions by Haar polynomials”, Math Notes, 66, № 3, 1999, 261
- Chunfang Shao, Peixin Ye, “Lebesgue constants for Chebyshev thresholding greedy algorithms”, J Inequal Appl, 2018, № 1, 2018, 102
- E.S Belinsky, “Metric Entropy of Subsets of Absolutely Convergent Fourier Series”, Journal of Approximation Theory, 110, № 2, 2001, 229
- V. N. Temlyakov, “Greedy approximation”, Acta Numerica, 17, 2008, 235
- Vladimir N. Temlyakov, “Greedy approximation of characteristic functions”, Proc. Steklov Inst. Math., 269, № 1, 2010, 247
- Владимир Николаевич Темляков, Vladimir Nikolaevich Temlyakov, Владимир Николаевич Темляков, Vladimir Nikolaevich Temlyakov, “Нелинейные поперечники по Колмогорову”, Матем. заметки, 63, № 6, 1998, 891
- A. S. Romanyuk, “Best trigonometric and bilinear approximations of classes of functions of several variables”, Math Notes, 94, № 3-4, 2013, 379
- S. A. Stasyuk, “Approximating Characteristics of the Analogs of Besov Classes with Logarithmic Smoothness”, Ukr Math J, 66, № 4, 2014, 553
- Y. Makovoz, “Uniform Approximation by Neural Networks”, Journal of Approximation Theory, 95, № 2, 1998, 215