Elements of the General Theory of Optimal Algorithms
摘要
A general scheme for estimating the total error of a computational algorithm is presented. Optimal algorithms are constructed under conditions that utilize the most complete information available about the problem. Reserves for computing optimization are considered.