Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases

DOI10.1134/S0001434612070036zbMath1272.68464MaRDI QIDQ1938623

Ya. B. Vegner, Sergey B. Gashkov

Publication date: 22 February 2013

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Lipschitz conditionLipschitz functionpolynomial basis(Lipshitz) continuous basiscomplexity of the approximate realization of functions

Mathematics Subject Classification ID

Lipschitz (Hölder) classes (26A16) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• On the computation of Boolean functions by analog circuits of bounded fan-in
• Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases
• On the complexity of the approximate realization of certain classes of differentiable functions of one variable by formulas in certain continuous bases
• On the complexity of approximate realization for classes of functions of several variables by schemes and formulas in bases of continuous functions
• Complexity of implementation of Boolean functions by real formulas
• On the Betti Numbers of Real Varieties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases