How to compute fast a function and all its derivatives
Jacques Morgenstern · ACM SIGACT News · 1985
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.