Breaking of 1RSB in Random MAX-NAE-SAT
Offered By: IEEE via YouTube
Course Description
Overview
Explore the intricacies of random MAX-NAE-SAT problem-solving in this 19-minute IEEE conference talk. Delve into the solution space, unsatisfied regime, and model analysis as presented by Zsolt Bartha, Nike Sun, and Yumeng Zhang. Examine the Garnet transition, moment bound, free variables, linked variables, and branch rate. Gain insights into previous work in the field and draw valuable conclusions from this comprehensive discussion on breaking 1RSB in random MAX-NAE-SAT.
Syllabus
Intro
Solution space
Unsatisfied regime
Model
Previous work
Garnet transition
moment bound
free variables
linked variables
branch rate
conclusion
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