{"ok":true,"nota":{"id":"f5a67a23b0dd5c70","slug":"matematicos-resolvieron-una-conjetura-abierta-desde-1995-sobre-algorit-f5a67a","titulo":"Matemáticos resolvieron una conjetura abierta desde 1995 sobre algoritmos aleatorios","resumen":"Investigadores de Microsoft Research demostraron la conjetura KLS, planteada en 1995, que trata sobre la dificultad de hacer cálculos en espacios de muchas dimensiones. La prueba cierra una pregunta que llevaba décadas sin respuesta.","fuente":"microsoft-research","fuenteNombre":"Microsoft Research","color":"#00a4ef","autor":"Xinzhi Zhang","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/","imagen":"https://www.microsoft.com/en-us/research/wp-content/uploads/2026/10/KLS-BlogHeroFeature-1400x788-1.jpg","tema":"ciencia","subtemas":["matematicas","algoritmos","conjeturas","computacion","espacios de alta dimension"],"entidades":["Microsoft Research","Kannan","Lovász","Simonovits"],"formato":"dato","entretenimiento":false,"pubTs":"2026-10-21T16:00:00.000Z","indexTs":"2026-10-21T18:38:40.550Z","hash":"fd07cc8a2c912ffd4166e8938f6c789963c234d2ea347084c62e422cbace6076","tsa":{"time":"Oct 21 18:39:39 2026 GMT","provider":"freetsa.org","sobre":"sello"},"stats":{"views":0,"likes":0,"clicks":0,"dwell":0},"tipo":"normal","registro":"hallazgo","porQueImporta":"Muchos algoritmos que usan azar, desde simulaciones científicas hasta cálculos de software, dependen de esta pregunta para saber qué tan rápidos pueden ser. Al resolverla, los expertos tienen una base teórica más firme para diseñar métodos eficientes. Es un avance que casi nadie ve, pero que sostiene herramientas que usamos todos los días. ¿Cuánto de lo que funciona en tu celular se apoya en problemas que nadie sabía resolver?","quienFirma":"Microsoft Research","confianza":"preprint","consulta":null},"sello":{"hash":"fd07cc8a2c912ffd4166e8938f6c789963c234d2ea347084c62e422cbace6076","sello":"c9d7608e908d2ff38c1afbc974a2ca4fa8793fdbba3e0526710d8722764e73b3","beacon":{"drand":{"cadena":"8990e7a9aaed2ffed73dbd7092123d6f289930540d7651336225dc172e51b2ce","ronda":6572564,"aleatorio":"79067e37564ac4dabd0909e0c00ab3366157ae5fcfc71c09fc9c6818a5df8f4d","tiempo":"2026-10-21T18:39:00.000Z"},"nist":{"cadena":2,"pulso":1993487,"salida":"773288DD6DA1C83A7AA1A4628722BE4BA8DF268603E178F122D33D1B7F5E74D73A8DBDF722071416E66C66D4657539EAB29B0250DD0E5CC6FDAA8791093EFDCE","tiempo":"2026-10-21T18:38:00.000Z"},"noAntes":"2026-10-21T18:39:00.000Z"},"verificacion":{"drand":true,"nist":true},"tsa":{"time":"Oct 21 18:39:39 2026 GMT","provider":"freetsa.org","sobre":"sello"},"original":{"titulo":"Solving a 31-year-old grand challenge in mathematics – the KLS conjecture","descripcion":"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 high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appeared first on Microsoft Research .","pubDate":"Wed, 21 Oct 2026 16:00:00 +0000","url":"https://www.microsoft.com/en-us/research/blog/solving-a-31-year-old-grand-challenge-in-mathematics-the-kls-conjecture/"},"indexado":"2026-10-21T18:38:40.550Z"}}