Get the latest tech news

Unique Games Conjecture

games conjecture In computational complexity theory, the unique games conjecture (often referred to as UGC) is a conjecture made by Subhash Khot in 2002.[1][2][3] The conjecture postulates that the problem of determining the approximate value of a certain type of game, known as a unique game, has NP-hard computational complexity. It has broad applications in the theory of hardness of approximation.

182– 189^ Håstad, Johan(1999),"Some Optimal Inapproximability Results", Journal of the ACM, 48(4): 798– 859, doi: 10.1145/502090.502098, S2CID 5120748.^ Brakensiek, Joshua; Huang, Neng; Zwick, Uri(2024), "Tight approximability of MAX 2-SAT and relatives, under UGC", ACM-SIAM Symposium on Discrete Algorithms, arXiv: 2310.12911 Goemans, Michel X.; Williamson, David P.(1995), "Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming", Journal of the ACM, 42(6): 1115– 1145, doi: 10.1145/227683.227684, S2CID 15794408^ Khot, Subhash; Minzer, Dor; Safra, Muli(2018),"Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion", 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. Karpinski, Marek; Schudy, Warren (2009), "Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems", Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. ", Windows On Theory, retrieved 2023-03-15^ Khot, Subhash; Minzer, Dor; Safra, M.(October 2018),"Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion", 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp.

Get the Android app