Mathematics Colloquia and Seminars

Return to Colloquia & Seminar listing

I will present some of the main ideas behind the asymptotically fastest algorithms for the Shortest / Closest Vector Problems and Integer Programming, explain the limits of current techniques and pose questions aimed at overcoming these limits. I will also discuss some open problems in lattice design, i.e. where the goal is to give explicit (or randomized) constructions of lattices with certain desirable properties (sphere packing density, covering density, etc.).