Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization
Offered By: IEEE via YouTube
Course Description
Overview
Explore a 24-minute IEEE conference talk delving into the connection between non-trivial derandomization and almost-everywhere circuit lower bounds. Join researchers Lijie Chen from MIT, Xin Lyu from Tsinghua University, and R. Ryan Williams from MIT as they present their findings on this intriguing topic in computational complexity theory. Gain insights into the relationship between derandomization techniques and circuit complexity, and discover how these concepts contribute to advancing our understanding of computational limits and algorithmic efficiency.
Syllabus
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
理论计算机科学基础 | Introduction to Theoretical Computer SciencePeking University via edX 算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam Computational Complexity
IIT Hyderabad via Swayam