ACM SIGACT News · 1985 · 51 citations · 0 references
ComputingComputer ScienceMathematicsAlgorithmsDerivativesTheory Of ComputationAlgorithm AnalysisAlgorithmic ComplexityComputational ComplexityTime ComplexityComplexity Of Numerical AlgorithmsPolynomial Time ComplexityPolynomial-time AlgorithmsRational Function ApproximationRational Function Computation
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.