Is the Unique Games Conjecture true? More unsolved problems in computer science In computational complexity theory, the unique games conjecture (often...

the field of computational complexity, and is best known for his unique games conjecture. Khot received the 2014 Rolf Nevanlinna Prize by the International...

it cannot be approximated up to a factor smaller than 2 if the unique games conjecture is true. On the other hand, it has several simple 2-factor approximations...

the exponential time hypothesis, the planted clique conjecture, and the unique games conjecture. Many worst-case computational problems are known to...

the unique games conjecture, another unproven computational hardness assumption according to which accurately approximating the value of certain games is...

has an approximation algorithm whose optimality depends on the unique games conjecture, and another difficult variation, finding a satisfying assignment...

unknown. Game complexity List of unsolved problems in mathematics Unique games conjecture Unsolved problems in computer science A nondeterministic Turing...

an inapproximability result that can be strengthened under the unique games conjecture. For tournament graphs, the minimum feedback arc set can be approximated...

only three known problems whose hardness is equivalent to the Unique Games Conjecture. Computable topology (the study of the topological nature of computation)...

expectation the ratio is always at least 0.87856.) Assuming the unique games conjecture, it can be shown that this approximation ratio is essentially optimal...

= NL problem PH = PSPACE problem L = P problem L = RL problem Unique games conjecture Is the exponential time hypothesis true? Is the strong exponential...

optimization (COP) Distributed constraint optimization Graph homomorphism Unique games conjecture Weighted constraint satisfaction problem (WCSP) Lecoutre, Christophe...

astronomical catalogue of galaxies UGC, a codon for cysteine Unique games conjecture, a conjecture in computational complexity User-generated content, media...

1978), mathematician, theoretical computer scientist famous for Unique games conjecture. Sanjeev Arora (b. 1968), mathematician, theoretical computer scientist...

conjecture Kelvin's conjecture Kouchnirenko's conjecture Mertens conjecture Pólya conjecture, 1919 (1958) Ragsdale conjecture Schoenflies conjecture (disproved...

_{0\leq \theta \leq \pi }{\frac {\theta }{1-\cos \theta }}.} If the unique games conjecture is true, this is the best possible approximation ratio for maximum...

respect to these algorithms have been used to call into question the unique games conjecture. Let n be a positive integer, and let γ be a real number in the...

strategy gives the best possible polynomial-time approximation if the unique games conjecture is true. It is also possible to use semidefinite programming or...

to better than f − 1 − ϵ {\displaystyle f-1-\epsilon } . If the Unique games conjecture is true, this can be improved to f − ϵ {\displaystyle f-\epsilon...

of California at Berkeley. Raghavendra showed that assuming the unique games conjecture, semidefinite programming is the optimal algorithm for solving...

the problem appears to be much harder to approximate. Under the unique games conjecture, an unproven but commonly used computational hardness assumption...

d-hitting set permits a d-approximation algorithm. Assuming the unique games conjecture, this is the best constant-factor algorithm that is possible and...

are based on other hypotheses, a notable one among which is the unique games conjecture. Since the early 1970s it was known that many optimization problems...

under the small set expansion hypothesis (a conjecture closely related to the unique games conjecture), the problem is NP-hard to approximate to within...

algorithm with an approximation factor of 2. Under the recent unique games conjecture, this factor is even the best possible one. NP-hard problems vary...

Goemans–Williamson approximation algorithm for MAX-CUT is optimal, assuming the unique games conjecture. This implication, due to Khot et al., was the impetus behind proving...

Goemans–Williamson approximation algorithm for MAX-CUT is optimal, assuming the unique games conjecture. The proof follows from two papers, one in 2004 with Subhash Khot...

geometry. It has also been suggested to have connections to the unique games conjecture in computational complexity theory. Oliver Lorscheid, along with...

Associate Professor at New York University. He is best known for his Unique games conjecture Subhash Maharia (born 1957), former union minister of state, rural...

(a computational complexity assumption closely related to the unique games conjecture), then it is NP-hard to approximate the problem to within ( 2 −...