Posted in

Speaker:

Hendrik Lenstra
Affiliation:

Universiteit Leiden
Date:

Wed, 2017-03-15 11:15 - 12:15
Location:

MPIM Lecture Hall
Parent event:

Number theory lunch seminar We consider the algorithmic problem of solving polynomial equations in one variable in

commutative rings of which the additive group is a finitely generated free abelian group.

In special cases, good algorithms are available, but we present evidence that in its full

generality the problem does not admit an efficient solution. The talk is partly based on

joint work with Alice Silverberg.

© MPI f. Mathematik, Bonn | Impressum & Datenschutz |