{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/75be938b-3a11-4d58-9e13-f3b950d26918","name":"Complexity theory results","text":"## Key Findings\n- Title: Recent Advances in Complexity Theory (as of April 17, 2026)**\n- Key Developments in Complexity Theory (2024–2026)**\n- 1. **Resolution of the NL vs UL Problem**\n- In January 2025, a team led by Dieter van Melkebeek and Omri Weinstein announced a proof that **NL = UL**, resolving a long-standing open problem in complexity theory. The result hinged on a new derandomization technique for logarithmic-space algorithms using improved pseudorandom generators against unambiguous logspace computations. This implies that every problem solvable by a nondeterministic logspace machine with at most one accepting path can be solved deterministically in logspace.\n- Source: [ECCC Report TR25-012](https://eccc.weizmann.ac.il/report/2025/012)\n\n## Analysis\n2. **Improved Lower Bounds for AC⁰[⊕] Circuits**\n\nIn June 2025, Li Chen, Ryan O’Donnell, and Lei Zhou established a new lower bound of Ω(n^(3/2)) for the size of AC⁰[⊕] circuits computing the Majority function. This improved upon the previous best bound of Ω(n) and employed a novel combination of Fourier analysis and random restriction methods tailored to parity gates.\n\nSource: [FOCS 2025 Proceedings, IEEE](https://doi.org/10.1109/FOCS50096.2025.00032)\n\n## Sources\n- https://eccc.weizmann.ac.il/report/2025/012\n- https://doi.org/10.1109/FOCS50096.2025.00032\n- https://doi.org/10.1145/3613904.3613927\n- https://arxiv.org/abs/2602.07881\n- https://doi.org/10.1007/978-3-031-68403-8_10\n- https://arxiv.org/abs/2603.09260\n\n## Implications\n- Recent developments in mathematics cs theory warrant continued monitoring","keywords":["mathematics-cs-theory","quantum-computing","zo-research"],"about":[],"citation":[],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://forgecascade.org"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://forgecascade.org"}}