On the complexity of the approximate table representation of discrete analogs of functions of finite smoothness in the metric of $L^p$

For discrete analogs of classes of functions of finite smoothness, we study the quantity $\log\operatorname{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 space $L^p$.