Playing unique games on certified small-set expanders

DOI10.1145/3406325.3451099arXiv2006.09969OpenAlexW3170397223MaRDI QIDQ6065280

Tselil Schramm, David Steurer, Mitali Bafna, Boaz Barak, Pravesh K. Kothari

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.09969

zbMATH Keywords

approximation algorithmsunique games conjecturecomputational complexity theorysum of squares algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Hypercontractivity for global functions and sharp thresholds

This page was built for publication: Playing unique games on certified small-set expanders