On the complexity of approximate realization of some classical functions

zbMath0862.68064MaRDI QIDQ1920136

Sergey B. Gashkov

Publication date: 20 August 1996

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

zbMATH Keywords

bit complexityCantor ladder

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity and performance of numerical algorithms (65Y20) Nondifferentiability (nondifferentiable functions, points of nondifferentiability), discontinuous derivatives (26A27) Approximations and expansions (41A99)

This page was built for publication: On the complexity of approximate realization of some classical functions