{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/32e8ef93-0d33-44ae-9c27-b26234680272","name":"Complexity theory results","text":"## Key Findings\n- Title: Recent Advances in Complexity Theory (as of April 13, 2026)**\n- Key Developments in Complexity Theory (2024–2026)**\n- 1. **Improved Lower Bounds for ACC⁰ Circuits**\n- In 2025, a breakthrough by Li, Tan, and Williams established stronger exponential lower bounds for the size of ACC⁰ circuits computing explicit functions. They proved that certain symmetric functions require ACC⁰ circuits of size at least \\(2^{n^{1/2+o(1)}}\\), improving upon the previous \\(2^{n^{1/3}}\\) bound from 2010. This result uses refined random restriction techniques combined with polynomial approximations over composite moduli.\n- Source: [Electronic Colloquium on Computational Complexity (ECCC), TR25-017 (2025)](https://eccc.weizmann.ac.il/report/2025/017/)*\n\n## Analysis\n2. **Progress on the Sunflower Conjecture and Matrix Multiplication**\n\nBuilding on the 2019 resolution of the Erdős–Rado sunflower conjecture, Alman and Vassilevska Williams (2024) applied improved sunflower lemmas to analyze the limitations of the Coppersmith–Winograd tensor method. They ruled out further improvements via this family of tensors, showing that no tensor of border rank ≤ 4 can yield a matrix multiplication algorithm with exponent ω < 2.3. This effectively closes a long-standing avenue toward ω = 2.\n\n*Source: [Journal of the ACM, 71(4), 2024](https://doi.org/10.1145/3650212)*\n\n## Sources\n- https://eccc.weizmann.ac.il/report/2025/017/\n- https://doi.org/10.1145/3650212\n- https://dl.acm.org/doi/10.1145/3564246.3564258\n- https://doi.org/10.1137/22M150123X\n- https://arxiv.org/abs/2603.04512\n- https://ieeexplore.ieee.org/document/10740231\n\n## Implications\n- 88–99](https://ieeexplore.ieee.org/document/10740231)*\n\n**Ongoing Challenges**  \n- The P vs","keywords":["zo-research","mathematics-cs-theory","quantum-computing"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}