Complexity of approximation of Lipschitz functions

DOI10.3103/S0027132208040074MaRDI QIDQ2512997zbMATH OpenOpenAlexFDO

Authors J. V. Wegner, S. B. Gashkov

Publication date 2 February 2015

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0027132208040074

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Recommendations

• Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases
• ``Curse of dimensionality for complexity of approximation for classes of functions satisfying Lipschitz condition
• scientific article; zbMATH DE number 1166265
• Complexity of approximate realization of functions, satisfying the Lipschitz condition, by schemes in continuous bases
• scientific article; zbMATH DE number 3884099

Cites work

• On the computation of Boolean functions by analog circuits of bounded fan-in

Cited in

(5)

• Complexity of approximate realizations of Lipschitz functions by schemes in continuous bases
• Unsolvability of some problems about piecewise-polynomial functions
• scientific article; zbMATH DE number 4057841 (Why is no real title available?)
• On the rate of approximation of functions in Lipschitz norms
• ``Curse of dimensionality for complexity of approximation for classes of functions satisfying Lipschitz condition

This page was built for publication: Complexity of approximation of Lipschitz functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2512997)