On the complexity of the approximate table representation of discrete analogs of functions of finite smoothness in the metric ofL P

For discrete analogs of classes of functions of finite smoothness, we study the quantity log Approx characterizing the minimal necessary length of tables that allow us to reconstruct functions from these classes with error not exceeding 1 in the metric of the spaceL ^p . Translated fromMatematicheskie Zametki, Vol. 64, No. 5, pp. 643–647, November, 1998. The author wishes to express his gratitude to his scientific adviser O. B. Lupanov for setting the problem and attention to the author's work. This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-01068.