Séminaire du 26 mars 2012 14h00: Joris van der Hoeven, LIX, École polytechnique.
On the complexity of skew arithmetic.
Let K be an effective field of constants of characteristic zero,
so that all field operations can be carried out by algorithms.
Given an indeterminate x and the derivation delta = x d / d x,
we will study various operations in the skew ring K[x, delta],
such as multiplication, division, greatest common divisors, series solutions, etc.
In analogy with the commutative case, we will give bounds for the computational
complexities of these operations in terms of the complexity of operator multiplication.
Last modified: Mon Mar 19 10:59:55 CET 2012