Elements of the general theory of optimal algorithms. Translated from the Ukrainian

DOI10.1007/978-3-030-90908-6MaRDI QIDQ2057553zbMATH OpenOpenAlexFDO

Authors V. K. Zadiraka, O. M. Lytvyn, I. V. Sergienko

Publication date 6 December 2021

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-90908-6

zbMATH Keywords

computational complexityoptimal algorithmcubature formulaeinterlineation and interflatation of functionsquality of algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
• scientific article; zbMATH DE number 177335
• scientific article; zbMATH DE number 3909615
• scientific article; zbMATH DE number 665283
• Some issues in the theory of optimal algorithms and informational complexity

Cited in

(2)

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

This page was built for publication: Elements of the general theory of optimal algorithms. Translated from the Ukrainian

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