1. Aho Aho, A.V. , A.V., Hopcroft Hopcroft, J.E. , J.E., and Ullman Ullman, J.D. , J.D. [1974]: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading 1974
2. Arora Arora, S. , S., and Barak Barak, B. , B. [2009]: Computational Complexity: A Modern Approach. Cambridge University Press, New York 2009
3. Ausiello Ausiello, G. , G., Crescenzi Crescenzi, P. , P., Gambosi Gambosi, G. , G., Kann Kann, V. , V., Marchetti-Spaccamela Marchetti-Spaccamela, A. , A., and Protasi Protasi, M. , M. [1999]: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin 1999
4. Bovet Bovet, D.P. , D.B., and Crescenzi Crescenzi, P. , P. [1994]: Introduction to the Theory of Complexity. Prentice-Hall, New York 1994
5. Garey Garey, M.R. , M.R., and Johnson Johnson, D.S. , D.S. [1979]: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco 1979, Chapters 1–3, 5, and 7