Explore the concept of Hardness Magnification in computational complexity theory through this 21-minute IEEE conference talk. Delve into topics such as the Minimum Circuit Size Problem, extending known lower bounds, and Hardness Magnification for all sparse NP languages. Learn about algorithms with small non-uniformity, gain insights into the intuition behind these concepts, and understand the proof of Theorem 1.2. Conclude by examining open problems in the field, as presented by speakers Lijie Chen, Ce Jin, and Ryan Williams.
Overview
Syllabus
Intro
Minimum Circuit Size Problem
How to view Hardness Magnification?
Extending Known Lower Bounds?
HM for all sparse NP languages
Hardness Magnification for MCSP
Algorithms with small non-uniformity
Intuition
Proof of Theorem 1.2
Open Problems
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
The Constant Depth Formula and Partial Function Versions of MCSP are Hard
-
Efficient Construction of Rigid Matrices Using an NP Oracle
-
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
-
Sharp Threshold Results for Computational Complexity
-
Circuit Lower Bounds from Algorithm Design - An Overview I
-
Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization
