In 2008, Prasad Raghavendra has shown that if the UGC is tr…

In 2008, Prasad Raghavendra has shown that if the UGC is true, then for every constraint satisfaction problem (CSP) the best approximation ratio is given by a certain simple semidefinite programming (SDP:=1deos) instance, which is in particular polynomial.