1. Applegate, D. L., Bixby, R. E., Chvátal, V., & Cook, W. J. (2006). The traveling salesman problem: A computational study. Princeton University Press.
2. Arora, S., & Barak, B. (2009). Computational complexity: A modern approach. Cambridge University Press.
3. Cook, S. (1971). The complexity of theorem proving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing (pp. 151–158). https://doi.org/10.1145/800157.805047
4. Cook, S. (2006). The P versus NP problem. In J. Carlson, A. Jaffe & A. Wiles (Eds.), The millennium prize problem (pp. 88–104). American Mathematical Society, Providence. Lance Fortnow. Clay Mathematics Institute. http://www.claymath.org/sites/default/files/pvsnp.pdf. Accessed 06 January 2023.
5. Cook, W. (2012). In pursuit of the traveling salesman: Mathematics at the limits of computation. Princeton University Press.