On the complexity of approximate realization of some classical functions

MaRDI QIDQ1920136zbMATH OpenFDO

Authors S. 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

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

Recommendations

• On the complexity of the approximate realization of certain classes of differentiable functions of one variable by formulas in certain continuous bases
• scientific article; zbMATH DE number 1166265
• scientific article; zbMATH DE number 3884099
• scientific article; zbMATH DE number 4046332

Cited in

(8)

• On the Kolmogorov complexity of functions of finite smoothness
• Complexity of approximating functions on real-life computers
• On the complexity of the approximate realization of certain classes of differentiable functions of one variable by formulas in certain continuous bases
• Feasible Real Functions and Arithmetic Circuits
• scientific article; zbMATH DE number 4023258 (Why is no real title available?)
• On the time complexity of partial real functions
• On the complexity of conversion between classic real number representations
• scientific article; zbMATH DE number 3903259 (Why is no real title available?)

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

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