S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

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

A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, vol.42, pp.230-265, 1936.

C. H. Papadimitriou, Computational complexity, 1994.

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

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

W. I. Gasarch, The P=?NP poll, SIGACT News, vol.33, issue.2, pp.34-47, 2002.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.