S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, Journal of the ACM, vol.45, issue.3, pp.501-555, 1998.
DOI : 10.1145/278298.278306

A. Björklund, T. Husfeldt, and M. Koivisto, Set Partitioning via Inclusion-Exclusion, SIAM Journal on Computing, vol.39, issue.2, pp.546-563, 2009.
DOI : 10.1137/070683933

E. Bonnet, V. Th, and . Paschos, Parameterized (in)approximability of subset problems, Operations Research Letters, vol.42, issue.3, pp.222-225, 2014.
DOI : 10.1016/j.orl.2014.03.005

N. Bourgeois, B. Escoffier, V. Th, and . Paschos, Approximation of min coloring by moderately exponential algorithms, Information Processing Letters, vol.109, issue.16, pp.950-954, 2009.
DOI : 10.1016/j.ipl.2009.05.002
URL : https://hal.archives-ouvertes.fr/hal-00906946

N. Bourgeois, B. Escoffier, V. Th, and . Paschos, Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Discrete Applied Mathematics, vol.159, issue.17, pp.1954-1970, 2011.
DOI : 10.1016/j.dam.2011.07.009

L. Cai and J. Chen, On Fixed-Parameter Tractability and Approximability of NP Optimization Problems, Journal of Computer and System Sciences, vol.54, issue.3, pp.465-474, 1997.
DOI : 10.1006/jcss.1997.1490

L. Cai and X. Huang, Fixed-Parameter Approximation: Conceptual??Framework and??Approximability Results, Algorithmica, vol.41, issue.2, pp.398-412, 2010.
DOI : 10.1007/s00453-008-9223-x

P. Chalermsook, B. Laekhanukit, and D. Nanongkai, Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 1308.
DOI : 10.1109/FOCS.2013.47

J. Chen, X. Huang, I. A. Kanj, and G. Xia, Strong computational lower bounds via parameterized complexity, Journal of Computer and System Sciences, vol.72, issue.8, pp.721346-1367, 2006.
DOI : 10.1016/j.jcss.2006.04.007

Y. Chen, M. Grohe, and M. Grüber, On Parameterized Approximability, Electronic Colloquium on Computational Complexity, vol.14, issue.106, 2007.
DOI : 10.1007/11847250_10

R. H. Chitnis, M. Hajiaghayi, and G. Kortsarz, Fixed-Parameter and Approximation Algorithms: A New Look, 1308.
DOI : 10.1007/978-3-319-03898-8_11

M. Cygan and M. Pilipczuk, Exact and approximate bandwidth, Theoretical Computer Science, vol.411, pp.40-423701, 2010.
DOI : 10.1016/j.tcs.2010.06.018
URL : http://doi.org/10.1016/j.tcs.2010.06.018

I. Dinur, The PCP theorem by gap amplification, Journal of the ACM, vol.54, issue.3, 2007.

R. G. Downey and M. R. Fellows, Parameterized complexity. Monographs in Computer Science, 1999.
DOI : 10.1007/978-1-4612-0515-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.3797

R. G. Downey, M. R. Fellows, and C. Mccartin, Parameterized Approximation Problems, Proc. International Workshop on Parameterized and Exact Computation, IWPEC'06, pp.121-129, 2006.
DOI : 10.1007/11847250_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.467.9346

R. G. Downey, M. R. Fellows, C. Mccartin, and F. A. , Parameterized approximation of dominating set problems, Information Processing Letters, vol.109, issue.1, pp.68-70, 2008.
DOI : 10.1016/j.ipl.2008.09.017

B. Escoffier, V. Th, E. Paschos, and . Tourniaire, Moderately exponential and parameterized approximation: some structural results

M. Fürer, S. Gaspers, and S. P. Kasiviswanathan, An exponential time 2-approximation algorithm for bandwidth, Theoretical Computer Science, vol.511, pp.23-31, 2013.
DOI : 10.1016/j.tcs.2013.03.024

O. Gabber and Z. Galil, Explicit constructions of linear-sized superconcentrators, Journal of Computer and System Sciences, vol.22, issue.3, pp.407-420, 1981.
DOI : 10.1016/0022-0000(81)90040-4

M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NPcompleteness, 1979.

J. Guo, I. Kanj, and S. Kratsch, Safe Approximation and Its Relation to Kernelization, Proc. International Workshop on Parameterized and Exact Computation, pp.169-180, 2011.
DOI : 10.1016/0020-0190(82)90022-9

M. Hajiaghayi, R. Khandekar, and G. Kortsarz, The foundations of fixed parameter inapproximability . CoRR, abs, 1310.

S. Hoory, N. Linial, and A. Wigderson, Expander graphs and their applications, Bulletin of the American Mathematical Society, vol.43, issue.04, pp.439-561, 2006.
DOI : 10.1090/S0273-0979-06-01126-8

R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), pp.512-530, 2001.
DOI : 10.1109/SFCS.1998.743516

E. J. Kim and R. Williams, Improved Parameterized Algorithms for above Average Constraint Satisfaction, Proc. International Symposium on Parameterized and Exact Computation, pp.118-131, 2011.
DOI : 10.1007/978-3-642-28050-4_10
URL : https://hal.archives-ouvertes.fr/hal-01496463

L. Liming, D. Cai, and . Juedes, On the existence of subexponential parameterized algorithms, Journal of Computer and System Sciences, vol.67, issue.4, pp.789-807, 2003.

C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM, vol.41, issue.5, pp.960-981, 1994.
DOI : 10.1145/185675.306789

M. V. Marathe and S. S. Ravi, On approximation algorithms for the minimum satisfiability problem, Information Processing Letters, vol.58, issue.1, pp.23-29, 1996.
DOI : 10.1016/0020-0190(96)00031-2

D. Marx, Parameterized Complexity and Approximation Algorithms, The Computer Journal, vol.51, issue.1, pp.60-78, 2008.
DOI : 10.1093/comjnl/bxm048

L. Mathieson, A proof checking view of parameterized complexity. CoRR, abs, 1206.

D. Moshkovitz and R. Raz, Two-query PCP with subconstant error, Journal of the ACM, vol.57, issue.5, pp.1-2929, 2008.
DOI : 10.1145/1754399.1754402

C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences, vol.43, issue.3, pp.425-440, 1991.
DOI : 10.1016/0022-0000(91)90023-X
URL : http://doi.org/10.1016/0022-0000(91)90023-x

O. Reingold, S. P. Vadhan, and A. Wigderson, Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, Proceedings 41st Annual Symposium on Foundations of Computer Science, 2001.
DOI : 10.1109/SFCS.2000.892006

H. U. Simon, On Approximate Solutions for Combinatorial Optimization Problems, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.294-310, 1990.
DOI : 10.1137/0403025

D. Zuckerman, Linear degree extractors and the inapproximability of max clique and chromatic number, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.103-128, 2007.
DOI : 10.1145/1132516.1132612

M. Input, A CNF ? on the variable set V

M. Input, A system Az = b of linear equations in the variable set V over F 2 , each equation involving exactly 3 variables

M. Input, A collection of m boolean functions on the variable set V , where each function depends on at most c variables