½Ò¥»
Computational Complexity,
C. M. Papadimitriou, Addison-Wesley, 1994.
½Òµ{§ë¼v¤ù
²Ä¤@³¹
Problems and algorithms
(3.03 Mb)
²Ä¤G³¹
Turing machines
(2.89 Mb)
²Ä¤T³¹
Computability
(69 Kb)
²Ä¤C³¹
Ralations between complexity classes
(78 Kb)
²Ä¤K³¹
Reductions and completeness
(271 Kb)
²Ä¤E³¹
NP-complete problems
(418 Kb)