How Efficiently Can We Solve Unique Games? - Lecture

Offered By: Institute for Advanced Study via YouTube

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

Aplicaciones de la teoría de grafos a la vida real
Miríadax Aplicaciones de la Teoría de Grafos a la vida real
Universitat Politècnica de València via UPV [X] Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX Genome Sequencing (Bioinformatics II)
University of California, San Diego via Coursera Algorithmic Information Dynamics: From Networks to Cells
Santa Fe Institute via Complexity Explorer