Low-Degree Hardness of Random Optimization Problems
Offered By: IEEE via YouTube
Course Description
Overview
Explore the intricacies of random optimization problems in this 19-minute IEEE conference talk. Delve into topics such as max independent set, planted problems, and spherical spin glass results. Gain insights from experts David Gamarnik, Aukosh Jagannath, and Alexander S. Wein as they discuss ensemble OGP and provide valuable comments on the subject. Discover what's missing in current approaches and expand your understanding of low-degree hardness in random optimization.
Syllabus
Random Optimization Problems
Max Independent Set
What's Missing?
Planted Problems (Continued)
Spherical Spin Glass: Results
Ensemble OGP
Comments
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Automata TheoryStanford University via edX Intro to Theoretical Computer Science
Udacity Computing: Art, Magic, Science
ETH Zurich via edX 理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera