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
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera