On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
Offered By: IEEE via YouTube
Course Description
Overview
Explore a thought-provoking lecture on the interconnections between exponential-time hypotheses, derandomization techniques, and circuit lower bounds in computational complexity theory. Delve into the research presented by experts from prestigious institutions as they discuss cutting-edge findings and theoretical advancements in the field. Gain insights into how these concepts relate to one another and their implications for understanding computational limits and efficiency.
Syllabus
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
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