For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of…
Solving a 31-year-old grand challenge in mathematics – the KLS conjecture
Publication summary. The terms of Microsoft Research do not allow reproduction of the full article: read the complete text on the original website.
Source summary (English)
Read the full article
www.microsoft.com