Accession Number:

AD0767703

Title:

A New Upper Bound on the Complexity of Derivative Evaluation,

Descriptive Note:

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1973-09-01

Pagination or Media Count:

9.0

Abstract:

Let Tn denote the number of arithmetic operations needed to evaluate the normalized derivatives P sub i ti factorial, i 0,...,n, for an nth degree polynomial pt over the field of complex numbers. The author shows Tn or 12 c n log squared n lower order terms where c may be taken as 12. Author

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE