Announcement_5

Our brand-new paper Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials with Prateek Dwivedi and Tim Seppelt has just been accepted at STOC 2026! Building on the framework from our recent ITCS’26 paper, we solve the long-standing open problem of separating the algebraic complexity classes VF, VBP, and VP – with restriction to symmetric circuits, at least…