Accession Number : AD0764101

Title :   Theory of Optimal Algorithms,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Traub,J. F.

Report Date : JUN 1973

Pagination or Media Count : 23

Abstract : Motivations for studying computational complexity are discussed. Some recent results in algebraic and analytic computational complexity are surveyed. This report is based on an invited paper presented at a Conference on Software for Numerical Mathematics held at Loughborough, England. (Author)

Descriptors :   (*NUMERICAL ANALYSIS, ALGORITHMS), INTERPOLATION, POLYNOMIALS, ITERATIONS, OPTIMIZATION

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE