There is no efficient reverse derivation mode for discrete derivatives

Authors:
Éric Schost
Affiliations:
LIX, École polytechnique, Palaiseau, France
Venue:
Theoretical Computer Science
Year:
2005

Citing 3
Cited 0

Non-commutative Gröbner bases in algebras of solvable type

Journal of Symbolic Computation
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Non-commmutative elimination in ore algebras proves multivariate identities

Journal of Symbolic Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

In the straight-line program model, it is known that computing all partial derivatives of a single polynomial induces only a constant increase in complexity, using the reverse derivation mode. We show that no such result holds for shifts, differences, q-shifts or q-differences.