The order of computational complexity of all bounded linear functional ap proximation problem is determined for the generalized Sobolev class Wp?（Id）, Nikolskii class H|∞k（Id） in the worst （deterministic）, stoc...The order of computational complexity of all bounded linear functional ap proximation problem is determined for the generalized Sobolev class Wp?（Id）, Nikolskii class H|∞k（Id） in the worst （deterministic）, stochastic and average case setting, from which it is concluded that the bounded linear functional approximation problem for the classes Wp?（Id） and H∞k（Id） is intractable in worst case setting, but is tractable with respect to stochastic and average case setting.展开更多
基金Project supported by the Natural Science Foundation of China(10371009) and Research Fund for the Doctoral Program Higher Education.
文摘The order of computational complexity of all bounded linear functional ap proximation problem is determined for the generalized Sobolev class Wp?（Id）, Nikolskii class H|∞k（Id） in the worst （deterministic）, stochastic and average case setting, from which it is concluded that the bounded linear functional approximation problem for the classes Wp?（Id） and H∞k（Id） is intractable in worst case setting, but is tractable with respect to stochastic and average case setting.
