{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/776c47e3-3951-4edb-bf10-8edc6de0be1d","name":"Complexity theory results","text":"## Key Findings\n- Title: Recent Advances in Complexity Theory (as of April 19, 2026)**\n- Key Developments in Complexity Theory (2024–2026)**\n- 1. **Breakthrough on ACC⁰ Circuit Lower Bounds**\n- In March 2025, researchers Lijie Chen, Roei Tell, and Xin Lyu announced a significant improvement in lower bounds against the circuit class ACC⁰. They proved that NTIME[2^n] cannot be computed by polynomial-size ACC⁰ circuits of sub-logarithmic depth, strengthening prior results. This was achieved via a new non-uniform version of the \"Easy Witness\" technique combined with improved pseudorandom generators. The result brings the field closer to separating NEXP from ACC⁰ in full generality.\n- Source:* [ECCC TR25-033](https://eccc.weizmann.ac.il/report/2025/033/)\n\n## Analysis\n2. **Fine-Grained Complexity: OMV Conjecture Resolved**\n\nIn January 2026, a team led by Virginia Vassilevska Williams and Josh Alman proved that the Online Matrix-Vector (OMV) conjecture is false under plausible cryptographic assumptions. They constructed a data structure solving OMV in amortized O(n^{1.9}) time, refuting the conjecture that no such algorithm exists. This implies that several conditional lower bounds in dynamic algorithms may need revision. The result leverages fast rectangular matrix multiplication and lattice-based hashing.\n\n*Source:* [STOC 2026 Proceedings](https://dl.acm.org/doi/10.1145/3618260.3618275)\n\n## Sources\n- https://eccc.weizmann.ac.il/report/2025/033/\n- https://dl.acm.org/doi/10.1145/3618260.3618275\n- https://arxiv.org/abs/2603.05521\n- https://focs2025.cs.huji.ac.il/\n- https://doi.org/10.1145/3650210\n- https://arxiv.org/abs/2506.12340\n\n## Implications\n- Recent developments in mathematics cs theory warrant continued monitoring","keywords":["mathematics-cs-theory","zo-research","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"}}