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
Randomized Methods in ComplexityIndian Institute of Technology Kanpur via Swayam Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization - Lijie Chen
Institute for Advanced Study via YouTube Expander Graph Application 2: Derandomization - Lecture 16c of CS Theory Toolkit
Ryan O'Donnell via YouTube Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
Association for Computing Machinery (ACM) via YouTube High-Precision Estimation of Random Walks in Small Space
IEEE via YouTube