Complexity of approximation of Lipschitz functions

被引:1
|
作者
Gashkov S.B. [1 ]
Wegner J.V. [1 ]
机构
[1] Moscow State University, Faculty of Mechanics and Mathematics, Leninskie Gory
基金
俄罗斯基础研究基金会;
关键词
Boolean Function; Lipschitz Function; Lipschitz Condition; Binary Sequence; Functional Element;
D O I
10.3103/S0027132208040074
中图分类号
学科分类号
摘要
The attainability of the lower bound by order is proved for the complexity of a problem of approximation of Lipschitz functions by diagrams of functional elements in bases consisting of a finite number of Lipschitz functions and a continuum of constants from a bounded set. © 2008 Allerton Press, Inc.
引用
收藏
页码:162 / 164
页数:2
相关论文
共 50 条