Lecture
Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
This lecture covers the concept of integer programming, focusing on John's Theorem and its application to compute the John ellipsoid for complete shortest vector computations in convex bodies. It also discusses how general integer programming can be reduced to shortest vector computations, highlighting the open problem of solving integer programming as efficiently as for ellipsoids.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace