|Date: Tuesday, February 24, 2015
Title: Computing without subtracting (and/or dividing)
Abstract: Algebraic complexity of a rational function can be defined as the minimal number of arithmetic operations required to compute it. Suppose that some of the four basic operations (say, subtraction and/or division) have been disallowed---can this restriction dramatically change the complexity of a given function? Some questions of this nature are relatively easy to answer, some are not.
The talk is based on joint work with D. Grigoriev (Bonn) and G. Koshevoy (Moscow).
Speaker: Sergey Fomin
Institution: University of Michigan