A. Stephen and . Cook, The complexity of theorem proving procedures, Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (STOC'71, pp.151-158, 1971.

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to algorithms, 2001.

L. Fortnow, The status of the P versus NP problem, Communications of the ACM, vol.52, issue.9, pp.78-86, 2009.
DOI : 10.1145/1562164.1562186

M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of npcompleteness (series of books in the mathematical sciences), 1979.

O. Goldreich, The foundations of cryptography -volume 1, basic techniques, 2001.

R. Harry, C. H. Lewis, and . Papadimitriou, Elements of the theory of computation, 1998.

C. H. Papadimitriou, Computational complexity, 1994.

M. Sipser, Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 1996.
DOI : 10.1145/230514.571645

A. M. Turing, On computable numbers, with an application to the entscheidungsproblem, Proceedings of the London Mathematical Society, vol.42, pp.230-265, 1936.

G. Leslie and . Valiant, Relative complexity of checking and evaluating, Inf. Process. Lett, vol.5, issue.1, pp.20-23, 1976.