|
Fall,
2004 (Aug.
29, 2004
--
Jan.
22, 2005)
Course No: S07010466
Credit: 4 Periods: 80
《
Complexity
Theory》
Required Textbook:
Garey,
M. R. and Johnson, D. S., Computers and Intractability. A Guide to the theory of
NP-completeness. San Francisco: W. H. Freeman,1979。中译本：《计算机和难解问题，NP完全性理论导引》，（美）M.R.加里，D.S.约翰逊
著， 张立昂，沈泓，毕源章 译， 科学出版社，1987。本课程采用中译本第一章到第七章。
Audience:
Postgraduate
Students (Ph. D and M. S)
Preparatory Courses:
Graph Theory
Time-table:
Wednesday 9:45 - 11:20;
Friday 9:45 - 11:20
Place:
Wednesday:
Room 2302;
Friday:
Room
2308
Test Form:
Open
Examination
|
