YoVDO

Approximating Constraint Satisfaction Problems on High Dimensional Expanders

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Virtual Reality Courses Server-Side Request Smuggling (SSRS) Courses Computational Complexity Courses Advanced Algorithms Courses Constraint Satisfaction Problems Courses High Dimensional Expanders Courses

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

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
IEEE via YouTube
Computation in the Brain Tutorial - Part 2
IEEE via YouTube
Computation in the Brain - Part 1
IEEE via YouTube
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube
Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube