1. Cook, S.A., The Complexity of Theorem-Proving Procedures, in Proc. 3rd Annual ACM Sympos. on Theory of Computing, Shaker Heights, Ohio, USA, 1971, pp. 151–158.
2. Levin, L.A., Universal Sequential Search Problems, Probl. Peredachi Inf., 1973, vol. 9, no. 3, pp. 115–116 [Probl. Inf. Trans. (Engl. Transl.), 1973, vol. 9, no. 3, pp. 265–266].
3. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979.
4. Karp, R.M., Reducibility Among Combinatorial Problems, Complexity of Computer Computations (Proc. Sympos. on the Complexity of Computer Computations, Yorktown Heights, USA, 1972), Miller, R.E. and Thatcher, J.W., Eds., New York: Plenum, 1972, pp. 85–103.
5. Bogdanov, A. and Trevisan, L., Average-Case Complexity, Found. Trends Theor. Comput. Sci., 2006, vol. 2, no. 1, pp. 1–106.