How to compute fast a function and all its derivatives. A variation on the theorem of Baur-Strassen. (English) Zbl 0558.68033

SIGACT News 16, No. 4, 60-62 (1984).
This note is about a simple and algorithmic proof of the striking result of W. Baur and V. Strassen [Theor. Comput. Sci. 22, 317-330 (1983; Zbl 0498.68028)] 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.


68W30 Symbolic computation and algebraic computation
68Q25 Analysis of algorithms and problem complexity


Zbl 0498.68028