Computational Complexity: A Modern Approach, 2009. ,
DOI : 10.1017/CBO9780511804090
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
Introduction to Algorithms, 2001. ,
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
The P=?NP poll, SIGACT News, vol.33, issue.2, pp.34-47, 2002. ,
On determinism versus nondeterminism and related problems, Proc. 24th IEEE Symp. on the Foundations of Computer Science, pp.429-438, 1983. ,
Thinking About Logic, p.7, 1995. ,
On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, vol.42, issue.2, pp.230-265, 1936. ,