[. Austrin, S. Benabbas, and A. Magen, On quadratic threshold CSPs [AH11] Per Austrin and Johan Håstad. Randomly supported independence and resistance, LATIN'10AH12] Per Austrin and Johan Håstad. On the Usefulness of Predicates CCC'12AM09] Per Austrin and Elchanan Mossel. Approximation Resistant Predicates from Pairwise Independence. Computational Complexity, pp.332-3431, 2009.
DOI : 10.1007/978-3-642-12200-2_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.9847

M. Cheraghchi, J. Håstad, M. Isaksson, and O. Svensson, Approximating linear threshold predicates A dichotomy theorem for maximum generalized satisfiability problems, Cre95] Nadia Creignou, pp.1-2, 1995.

L. Engebretsen and J. Holmerin, More efficient queries in pcps for np and improved approximation hardness of maximum csp. Random Struct, Algorithms, vol.33, issue.4, pp.497-514, 2008.

X. Michel, D. P. Goemans, and . Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, Journal of the ACM, vol.42, pp.1115-1145, 1995.

J. Håstad, Some optimal inapproximability results, Journal of the ACM, vol.48, issue.4, pp.798-859, 2001.
DOI : 10.1145/502090.502098

G. Hast, Beating a Random Assignment ? Approximating Constraint Satisfaction Problems, 2005.

J. Håstad, On the Power of Unique 2-prover 1-round Games, Kho02] Subhash Khot STOC'02, pp.767-775, 2002.

H. Karloff and U. Zwick, A 7/8-approximation algorithm for MAX 3SAT?, Proceedings 38th Annual Symposium on Foundations of Computer Science, pp.406-415, 1997.
DOI : 10.1109/SFCS.1997.646129

P. Raghavendra, Optimal algorithms and inapproximability results for every CSP?, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.245-254, 2008.
DOI : 10.1145/1374376.1374414

A. Samorodnitsky and L. Trevisan, A PCP characterization of NP with optimal amortized query complexity, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.191-199, 2000.
DOI : 10.1145/335305.335329

A. Samorodnitsky and L. Trevisan, Gowers Uniformity, Influence of Variables, and PCPs, SIAM Journal on Computing, vol.39, issue.1, pp.323-360, 2009.
DOI : 10.1137/070681612

F. S. Woods, Advanced Calculus: A Course Arranged with Special Reference to the Needs of Students of Applied Mathematics, 1926.

U. Zwick, Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables Per Constraint, SODA'98, pp.201-210, 1998.