Elements of the general theory of optimal algorithms

DOI10.1007/S10559-025-00791-XMaRDI QIDQ6939064zbMATH OpenFDO

Authors V. K. Zadiraka, I. V. Shvidchenko

Publication date 22 August 2025

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10559-025-00791-X

zbMATH Keywords

approximate solutioncomputational algorithmcomputer technologieserror of approximate solutionoptimization of algorithmsreserves for computing optimization

Mathematics Subject Classification ID

Error analysis and interval analysis (65G99) Complexity and performance of numerical algorithms (65Y20)

Cites work

• Elements of the general theory of optimal algorithms. Translated from the Ukrainian
• scientific article; zbMATH DE number 3858374 (Why is no real title available?)
• scientific article; zbMATH DE number 3827201 (Why is no real title available?)
• scientific article; zbMATH DE number 3688714 (Why is no real title available?)
• scientific article; zbMATH DE number 44184 (Why is no real title available?)
• scientific article; zbMATH DE number 3539756 (Why is no real title available?)
• scientific article; zbMATH DE number 3359723 (Why is no real title available?)
• S-word arithmetic and high precision calculations

This page was built for publication: Elements of the general theory of optimal algorithms

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