Mathematics Colloquium

Tel Aviv University

Monday, December 18, 2017
Schreiber 006
:: MINT Distinguished Lecture ::
Sergey Fomin
University of Michigan
Computing without subtracting (and/or dividing)

Algebraic complexity of a rational function can be defined as the minimal number of arithmetic operations required to compute it. Can restricting the set of allowed arithmetic operations dramatically increase the complexity of a given function (assuming it is still computable in the restricted model)? In particular, what can happen if we disallow subtraction and/or division? Joint work with Dima Grigoriev and Gleb Koshevoy.

Colloquium's homepage : www  |  Sergey Fomin's homepage : www