For decades, a key question about the challenges of high-dimensional computation resisted proof. New research resolves the KLS conjecture, removing a major barrier to understanding the efficiency of randomized algorithms used throughout science and computing.
https://msft.it/6011aar01