The Subspace Flatness Conjecture and Faster Integer Programming
b'Thomas Rothvoss speaking at the BIRS workshop 23w5140: Approximation Algorithms and the Hardness of Approximation (Sep 17 - Sep 22). Recorded by the Banff International Research Station for Mathematical Innovation and Discovery.'