Speaker: Jens Happe and Kevin Hare (MRG)
Title: The LLL algorithm exposed.
Abstract: The LLL algorithm for finding short vectors in a lattice is probably the most important development in computational number theory in the last few decades. It solves a number of difficult problems in polynomial time. These include factoring and finding minimal polynomials.
These two back-to-back talks will discuss both the algorithm and its principal applications. The talks are expository and will assume very little background.