How to compute fast a function and all its derivatives

1 April 1985

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGACT News

Vol. 16 (4) , 60-62
https://doi.org/10.1145/382242.382836

Abstract

This note is about a simple and algorithmic proof of the striking result of BAUR-STRASSEN [1] showing that the complexity of the evaluation of a rational function of several variables and all its derivatives is bounded above by three times the complexity of the evaluation of the function itself.

Keywords

COMPUTE FAST
NOTE
FAST A FUNCTION
BAUR STRASSEN
ALGORITHMIC PROOF
RATIONAL FUNCTION

This publication has 0 references indexed in Scilit: