A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-12390002, 1979. ,
DOI : 10.1016/0020-0190(79)90002-4
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, p.3, 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 NP-Completeness, 1979. ,
The P=?NP poll, SIGACT News, vol.33, issue.2, pp.34-47, 2002. ,
The Nature of Computation, 2011. ,
DOI : 10.1093/acprof:oso/9780199233212.001.0001
Computational complexity, 1994. ,
On Computable Numbers, with an Application to the Entscheidungsproblem, Proceedings of the, pp.230-265, 1936. ,