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
The Next Generation of InfrastructureDelft University of Technology via edX The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX Advanced Data Structures in Java
University of California, San Diego via Coursera Theory of Computation
Indian Institute of Technology Kanpur via Swayam 离散数学
Shanghai Jiao Tong University via Coursera