述セ
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)