Complexity of approximating functions on real-life computers

DOI10.1142/S0129054115500082MaRDI QIDQ5250282zbMATH OpenOpenAlexFDO

Authors B. Ya. Ryabko

Publication date 19 May 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fd80a525884607997a9a7977dc960a0caa6243de

zbMATH Keywords

computational complexityperformance evaluationinformation theory\(\varepsilon\)-entropy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17)

Recommendations

• On the complexity of the approximation of functions with given moduli of continuity of the first and second orders in some piecewise linear and polynomial bases
• Computing functions by approximating the input
• On the complexity of approximate realization of some classical functions
• Computing over the reals: foundations for scientific computing.
• scientific article; zbMATH DE number 52121

Cites work

• On the efficiency and capacity of computers

Cited in

(1)

• scientific article; zbMATH DE number 4057841 (Why is no real title available?)

This page was built for publication: Complexity of approximating functions on real-life computers

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