Before revision:  By exploiting this combinatorial property, in combination with a natural reduction from CSPsover large finite alphabets to OCSPs , we give optimal inapproximability results for all OCSPs.
After revision:  By exploiting this combinatorial property, in combination with the hardness results of the resulting families of CSPs , we give optimal inapproximability results for all OCSPs.