Browse Dept. of Computer Science by Subject "Hardness of Approximation"
Now showing items 1-1 of 1
(2014-05-30)In this thesis we consider two questions motivated by the Unique Games Conjecture . The first question is concerned with the validity of the Unique Games Conjecture when the constraint graph is restricted to the Boolean ...