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.
Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits
Overview
Syllabus
Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Computational Complexity
-
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
-
The Polynomial Time Hierarchy: Graduate Complexity Lecture at CMU
-
Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
-
Learning Shallow Quantum Circuits and Quantum States in Polynomial Time
-
Recent Structure Lemmas for Depth-Two Threshold Circuits
