Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits
Offered By: IEEE via YouTube
Course Description
Overview
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.
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 TheoryIndian Institute of Technology Kanpur via Swayam Computational Complexity
IIT Hyderabad via Swayam Proof and Circuit Complexity - Robert Robere
Institute for Advanced Study via YouTube Quantum Complexity - Quantum Computation at CMU
Ryan O'Donnell via YouTube Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
Association for Computing Machinery (ACM) via YouTube