Richard M. Karp (1972). “Reducibility Among Combinatorial Problems”. Trong R. E. Miller and J. W. Thatcher (biên tập). Complexity of Computer Computations. New York: Plenum. tr. 85–103. Liên kết ngoài trong |chapter= (trợ giúp)
doi.org
Cook, S.A. (1971). “The complexity of theorem proving procedures”. Proceedings, Third Annual ACM Symposium on the Theory of Computing, ACM, New York. tr. 151–158. doi:10.1145/800157.805047.
