[Unique Games Conjecture [1]}]
There exists constant \(\epsilon _0 \in (0,1)\)  such that the following holds. For every fixed choice of \(\epsilon _c,\epsilon _s \in (0,\epsilon _0)\) , there exists \(t = t(\epsilon _c,\epsilon _s)\)  such that the \((\epsilon _c,\epsilon _s)\) -Unique Games problem is hard on label sets of size \(t\) .
