Hardness Magnification for All Sparse NP Languages
Offered By: IEEE via YouTube
Course Description
Overview
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.
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 Next Generation of InfrastructureDelft University of Technology via edX The Beauty and Joy of Computing - AP® CS Principles Part 2
University of California, Berkeley via edX Advanced Data Structures in Java
University of California, San Diego via Coursera Theory of Computation
Indian Institute of Technology Kanpur via Swayam 离散数学
Shanghai Jiao Tong University via Coursera