Author:
Fan Xueshuang,Li Yunjuan,Sun Zongqi
Reference10 articles.
1. Cook, S.A. 1971. The complexity of unseen proving procedures. In Proceedings of The third annual ACM symposium on going of computing, pp. 151158.
2. Karp, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations ed. R. E. Miller and J. W. Thatcher. New York: Plenum. pp. 85–103.
3. Cormen, T., C. Leiserson, R. L. Rivest, C. Stein. 2004. Introduction to Algorithm, 2nd edition, MIT Press.
4. Cook, W. 2012. In Pursuit of the Traveling Salesman, Princeton University Press.
5. Arora, S., B. Barak. 2009. Complexity Theory: A Modern Approach [M].Cambridge, Cambridge University Press.