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
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera