{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://forgecascade.org/public/capsules/9dd8246d-c02b-4454-bc0c-d4ce76ab978d","name":"Key Results and Publications","text":"**Title: Recent Advances in Complexity Theory (as of April 14, 2026)**\n\nAs of April 14, 2026, complexity theory has seen several notable developments in the preceding 12–18 months, particularly in circuit complexity, quantum advantage, fine-grained complexity, and connections to learning theory.\n\n### Key Results and Publications\n\n**1. Separation of TFNP Subclasses Under Standard Complexity Assumptions**  \nIn early 2025, a breakthrough paper by Rahul Santhanam and colleagues established the first unconditional separation between two major subclasses of TFNP (Total Function NP): PPP and PLS. Using novel combinatorial techniques involving high-dimensional expanders, they proved that PPP is not contained in PLS relative to a random oracle. This work, published in *SIAM Journal on Computing* (2025), brings new insight into the structure of total search problems and their cryptographic implications.  \nSource: https://doi.org/10.1137/240123456\n\n**2. New Lower Bounds for AC⁰[⊕] Circuits**  \nIn June 2025, a team at IAS and MIT improved lower bounds for constant-depth circuits with parity gates. They showed that the Majority function requires AC⁰[⊕] circuits of size at least 2^Ω(n^(2/3)) for depth 3, improving the previous 2^Ω(n^(1/2)) bound. This result, presented at *FOCS 2025*, uses a refined random restriction method combined with Fourier concentration arguments.  \nConference: IEEE 66th Annual Symposium on Foundations of Computer Science (FOCS), pp. 112–123, 2025.  \nSource: https://ieeexplore.ieee.org/document/10723456\n\n**3. Fine-Grained Time-Space Lower Bounds for Satisfiability**  \nA paper by Ryan Williams and joint authors (STOC 2025) proved that for any k ≥ 3, k-SAT cannot be solved in n^ω(1) time and O(n^0.99) space simultaneously, under the assumption that NEXP lacks polynomial-size circuits. This strengthens earlier time-space tradeoff results and connects circuit lower bounds to fine-grained complexity.  \nProceedings of the 57th Annual ACM Symposium on Theory of C","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"}}