How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
From MaRDI portal
Publication:5494983
DOI10.1109/FOCS.2011.78zbMath1292.68114MaRDI QIDQ5494983
Konstantin Makarychev, Alexandra Kolla, Yury Makarychev
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Other game-theoretic models (91A40) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Independent sets in semi-random hypergraphs ⋮ The simultaneous semi-random model for TSP ⋮ Pseudorandom sets in Grassmann graph have near-perfect expansion ⋮ Unnamed Item ⋮ Approximation Algorithms for CSPs
This page was built for publication: How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
