Forge Capsule

Complexity theory results

## Key Findings - Title: Recent Advances in Complexity Theory (as of April 16, 2026)** - Key Developments in Complexity Theory (2024–2026)** - 1. **Breakthrough on the Complexity of Matrix Multiplication** - In January 2025, researchers Alman, Vassilevska Williams, and Xu improved the upper bound on the matrix multiplication exponent ω, reducing it to **2.371552**, refining prior bounds using a novel combination of laser method enhancements and algorithmic bootstrapping techniques. This result represents the most efficient known algorithm for matrix multiplication in the algebraic complexity model. - Source*: [arXiv:2501.03748](https://arxiv.org/abs/2501.03748) ## Analysis 2. **Separation of TFNP Subclasses un...