《计算模型与算法技术教学课件》1-Introduction.pptVIP

* 1-4 have well known efficient (polynomial-time) solutions 5: primality testing has recently been found to have an efficient solution This is a great problem to discuss because it has recently been in the news (see mathworld news at: /news/2002-08-07_primetest/ or original article: http://www.cse.iitk.ac.in/primality.pdf) 6(TSP)-9(chess) are all problems for which no efficient solution has been found it is possible to informally discuss the “try all possibilities” approach that is required to get exact solutions to such problems 10: Towers of Hanoi is a problem that has only exponentia