Tags » Unique Games Conjecture

On extended formulations

Several results in theoretical computer science are characterized by the conditional sentence “.. unless P NP”. As an example, a well known fact is that the… 1,290 more words

Combinatorial Optimization

A look at the Unique Games Conjecture

A central question in computer science is the famous problem of whether the decision problems whose solution can be checked in polynomial time can also be solved in polynomial time, also known as the P vs. 1,277 more words

Approximation Algorithms