Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits

Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits

Explore a groundbreaking 20-minute IEEE conference talk that delves into the complexity theory of non-deterministic quasi-polynomial time and its average-case hardness for ACC circuits. Gain insights from speaker Lijie Chen as they present cutting-edge research on computational complexity, circuit complexity, and the relationships between different complexity classes. Discover the implications of this work for understanding the power and limitations of ACC circuits, and how it contributes to the broader landscape of computational theory.