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
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
On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, vol.42, pp.230-265, 1936. ,
Computational complexity, 1994. ,
Introduction to Algorithms, 2001. ,
Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 2006. ,
DOI : 10.1145/230514.571645
The P=?NP poll, SIGACT News, vol.33, issue.2, pp.34-47, 2002. ,
Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979. ,