Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > YANG HU:
All reports by Author Yang Hu:

TR25-184 | 18th November 2025
Lijie Chen, Yang Hu, Hanlin Ren

New Algebrization Barriers to Circuit Lower Bounds via Communication Complexity of Missing-String

The *algebrization barrier*, proposed by Aaronson and Wigderson (STOC '08, ToCT '09), captures the limitations of many complexity-theoretic techniques based on arithmetization. Notably, several circuit lower bounds that overcome the relativization barrier (Buhrman--Fortnow--Thierauf, CCC '98; Vinodchandran, TCS '05; Santhanam, STOC '07, SICOMP '09) remain subject to the algebrization barrier.

... more >>>



ISSN 1433-8092 | Imprint