Polynomial-time algorithms in algebraic number theory

Talk by Prof. Dr. Henrik Lenstra

Date: 31.03.26  Time: 16.30 - 18.00  Room:

This lecture requires no previous knowledge of algebraic number theory, as even the most elementary notions of that theory are computationally too complicated to be accessible by algorithms that run in polynomial time. Thus, the field described by the title is quite restricted in scope. The best results were obtained by means of a relatively recently developed technique that is closely related to the method of "blowing up" known from algebraic geometry. It is hoped that the latter field will also profit from the insights gained by the new algorithmic approach. The lecture represents joint work with Daan van Gent and Alexander Spieksma.