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

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

Computers and intractability: A guide to the theory of npcompleteness (series of books in the mathematical sciences), 1979. ,

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

Elements of the theory of computation, 1998. ,

Computational complexity, 1994. ,

Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 1996. ,

DOI : 10.1145/230514.571645

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

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