1. Aho, A.V., J.E. Hoperoft, J.D. Ullman: The design and analysis of computer algorithms, Addison Wesley, 1974.
2. Cook, S.A.: The complexity of theorem proving procedures, Proc. 3rd Ann. ACM Symp. on Theory of Coputing, 1971.
3. Karp, R.M.: Reducibility among combinatorial problems, in R.E.Muller and J.W.Thatcher (eds.), Complexity of Computer computations, Plenum Press, 1972.
4. M.R. Garey and D.S. Johnson: Computers and intractability. A guide to NP-completeness, Freeman, 1979.
5. Horowitz, E., S. Sahni: Fundamentals of computer algorithms, Computer Science Press, 1978.