1. Cook, S. A. in Proc. 3rd Annu. ACM Symp. on Theory of Computing 151–158 (Assoc. Comput. Machinery, New York, (1971).
2. Garey, M. & Johnson, D. S. Computers and Intractability: A Guide to the Theory of NP-completeness (Freeman, San Francisco, (1979).
3. Papadimitriou, C. Computational Complexity (Addison-Wesley, Readings, (1994).
4. Fu, Y. T. & Anderson, P. W. Application of statistical mechanics to NP-complete problems in combinatorial optimization. J. Phys. A 19, 1605–1620 (1985).
5. Mézard, M., Parisi, G. & Virasoro, M. A. Spin Glass Theory and Beyond (World Scientific, Singapore, (1987).