. S. References, C. Arora, R. Lund, M. Motwani, M. Sudan et al., Proof verification and the hardness of approximation problems, Journal of ACM, vol.45, issue.3, pp.501-555, 1998.

]. E. Bmvt78, R. J. Berlekamp, H. C. Mceliece, and . Van-tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, pp.24384-386, 1978.

M. [. Bruck and . Naor, The hardness of decoding linear codes with preprocessing, IEEE Transactions on Information Theory, vol.36, issue.2, pp.381-384, 1990.
DOI : 10.1109/18.52484

D. [. Colbourn, On deciding switching equivalence of graphs, Discrete Applied Mathematics, vol.2, issue.3, pp.181-184, 1980.
DOI : 10.1016/0166-218X(80)90038-4

J. [. Chen, M. Flum, and . Grohe, Bounded nondeterminism and alternation in parameterized complexity theory, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., pp.13-29, 2003.
DOI : 10.1109/CCC.2003.1214407

]. A. Ehhr00a, J. Ehrenfeucht, T. Hage, G. Harju, and . Rozenberg, Complexity issues in switching of graphs, Theory and Application to Graph Transformations, pp.59-70, 2000.

]. A. Ehhr00b, J. Ehrenfeucht, T. Hage, G. Harju, and . Rozenberg, Pancyclicity in switching classes, Inf. Process. Lett, vol.73, pp.5-6153, 2000.

M. [. Flum and . Grohe, Parameterized Complexity Theory, 2006.

D. [. Garey and . Johnson, Computers and Intractability, A guide to the Theory of NP-Completeness, 1979.

]. J. Hag01 and . Hage, Structural Aspects Of Switching Classes, Leiden Institute of Advanced Computer Science, 2001.

]. R. Hay96 and . Hayward, Recognizing P 3 -structure: A switching approach, J. Comb. Theory, Ser. B, vol.66, issue.2, pp.247-262, 1996.

]. A. Her99, . L. Hertzhf65-]-s, H. Hakimi, and . Frank, On perfect switching classes Cut-set matrices and linear codes, Discrete Applied Mathematics IEEE Trans. Inform. Theory, vol.94, issue.1-3, pp.3-7, 1965.

J. Hage, T. Harju, and E. Welzl, Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes, Proceedings of ICGT 2002, pp.148-160, 2002.
DOI : 10.1007/3-540-45832-8_13

E. [. Hardy and . Wright, An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 2008.
DOI : 10.1090/S0002-9904-1929-04793-1

]. E. Jel08 and . Jelínková, Three NP-complete optimization problems in seidel's switching, Proceedings of IWOCA 2007, pp.121-135, 2008.

]. E. Jel11, . [. Jelínková, J. Jelínková, and . Kratochvíl, Switching to hedgehog-free graphs is NP-complete On switching to H-free graphs, TAMC 2011, pp.463-470, 2008.

J. Kratochvíl, J. Ne?et?il, O. Z´ykaz´ykanie06, and ]. J. Seidel, On the Computational Complexity of Seidel's Switching, Proc. 4th Czech. Symp. Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory, and Computing, pp.161-166, 1974.
DOI : 10.1016/S0167-5060(08)70622-8

]. J. Sei76 and . Seidel, A survey of two-graphs, Proc. Colloquio Internazionale sulle Teorie Combinatorie Accademia Nazionale dei Lincei, pp.481-511, 1973.

D. [. Seidel and . Taylor, TWO-GRAPHS, A SECOND SURVEY, Algebraic Methods in Graph Theory (Proc. Internat. Colloq, pp.689-711, 1978.
DOI : 10.1016/B978-0-12-189420-7.50022-0

]. O. Suc08 and . Such´ysuch´y, Some parametrized problems related to Seidel's switching, Proceedings of IWOCA 2007, pp.148-157, 2008.

]. V. Vaz01 and . Vazirani, Approximation Algorithms, 2001.