YoVDO

How Efficiently Can We Solve Unique Games? - Lecture

Offered By: Institute for Advanced Study via YouTube

Tags

Computational Complexity Courses Graph Theory Courses Algorithms Courses Approximation Algorithms Courses Constraint Satisfaction Problems Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the computational complexity of solving Unique Games in this 16-minute conference talk by Yotam Dikstein from the Institute for Advanced Study. Delve into the challenges and potential solutions for efficiently addressing Unique Games, a fundamental problem in theoretical computer science. Gain insights into the latest research and algorithmic approaches presented by Dikstein as part of the "Short Talks by Postdoctoral Members" series, delivered on October 1, 2024.

Syllabus

How Efficiently Can We Solve Unique Games? - Yotam Dikstein


Taught by

Institute for Advanced Study

Related Courses

Information Theory
The Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera