1. S. A. Cook, “The Complexity of Theorem-Proving Procedures,” in Proc. of the Third Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, United States, May 3–5, 1971 (ACM, New York, 1971), pp. 151–158.
2. R. M. Karp, “Reducibility among Combinatorial Problems,” in Complexity of Computer Computations, Ed. by R.E. Miller and J.W. Thatcher (Plenum, New York, 1972), pp. 85–104.
3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979; Mir, Moscow, 1982).
4. D. S. Johnson, “The NP-Completeness Column,” ACM Trans. Algorithms 1(1), 160–176 (2005).
5. D.-Z. Du and K.-I. Ko, Theory of Computational Complexity (Wiley, New York, 2000).