Khot's Unique Games Conjecture in transversal-polynomial form
Statement
Let be an -fold cover of a graph , where is the transversal polynomial and is the maximum number of edges satisfied by a labelling of . For all , there exists such that, given an -fold cover of a graph , it is NP-hard to distinguish between the following two cases:
- ;
- .
This is the Unique Games Conjecture, a central complexity-theoretic hypothesis whose truth would imply optimality results for approximation algorithms for several NP-hard problems. In this formulation, the degree of the transversal polynomial records the maximum number of edges satisfied by a labelling; the source provides no resolution of the conjecture.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.