Assuming the Unique Games Conjecture we establish
some general results on approximation resistance.

There is a universal constant c<1, such that any predicate that
accepts at least a fraction c of the inputs is approximation resistant.

There is a constant D such that a random predicate on k Boolean
inputs that accepts Dk^2 of its input string,  is, with high
probability approximation resistant.