This paper studies how well the standard LP relaxation approximates a k-ary constraint satisfaction problem (CSP) on label set [L]. We show that, assuming the Unique Games Conjecture, it achieves an approximation within O(k^3\cdot \log L) of the optimal approximation factor. In particular we prove the following hardness result: let ... more >>>