Approximating Constraint Satisfaction Problems on High Dimensional Expanders
Offered By: IEEE via YouTube
Course Description
Overview
Explore a comprehensive lecture on approximating constraint satisfaction problems in high dimensional expanders, presented by experts Vedat Levi Alev, Fernando Granha Jeronimo, and Madhur Tulsiani. Delve into the problem description, its significance, and previous work in the field. Examine the challenges and potential solutions, including discussions on VRSB and RSS. Gain insights into general expanders and natural collections as the speakers provide a thorough summary of this complex topic in computational mathematics and theoretical computer science.
Syllabus
Introduction
Problem Description
Problem
Why this worthwhile
Previous work
Is this okay
Is this easy
VRS
BRS
Summary
General Expander
Natural Collections
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
Advanced Algorithms and ComplexityUniversity of California, San Diego via Coursera NP-Complete Problems
University of California, San Diego via edX Efficient Zero Knowledge Proof from Interactive Proofs
Simons Institute via YouTube Dynamic Algorithms for LIS and Distance to Monotonicity
Association for Computing Machinery (ACM) via YouTube Near-Optimal Decremental SSSP in Dense Weighted Digraphs
IEEE via YouTube