Back to news

Chips & deep tech · Official

Mathematicians Solve 31-Year-Old KLS Conjecture, a Major Open Problem in Geometry

Microsoft Research blog ·

At a glance

The KLS conjecture, which asks how far the best flat cut of a probability distribution in high-dimensional space is from the best possible cut, has been proven. The research was done by two researchers, including Xinzhi Zhang of Microsoft Research. The result shows that the difference stays within a fixed limit no matter how high the dimension gets.

Key points

Why it matters

This problem is a foundation for understanding how efficient randomized algorithms (methods that use randomness to solve problems) can be, so it will affect statistics and computing broadly.

Original source

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

Microsoft Research blog · Oct 22, 01:00 KST

Read on Microsoft Research blog ↗

AI summarized the original article. Check the original for accuracy. Copyright belongs to Microsoft Research blog.

Chips & deep tech