Complexity of approximation of Lipschitz functions

DOI10.3103/S0027132208040074zbMath1304.68073OpenAlexW2095253244MaRDI QIDQ2512997

J. V. Wegner, Sergey 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)

Related Items (1)

Unsolvability of some problems about piecewise-polynomial functions

Cites Work

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

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