Complexité de l'arithméthique tordue
[ Homepage | Publications | Talks | TeXmacs | Mathemagix ]

Abstract

Let be an effective field of constants of characteristic zero, so that all field operations can be carried out by algorithms. Given an indeterminate and the derivation , we will study various operations in the skew ring , 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.

Occasion: INRIA, Rocquencourt, March 26, 2012; LIX, École polytechnique, Palaiseau, 2011

Documents: slideshow, TeXmacs source