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
理论计算机科学基础 | 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