|
Spring,
2009 (Feb.
15,
2009
--
July
10,
2009)
Course No: MA05434
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:
Tuesday
14:50 - 16:20;
Friday 14:50 - 16:20
Place:
理化中心大楼 Room
15008
Test Form:
Open
Examination
|
