《计算复杂性理论》2th wiley2014最新书籍

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

本帖隐藏的内容

Theory of Computational Complexity_by Ding-Zhu_Du,_Ker-I_.pdf (3.24 MB, 需要: 5 个论坛币)

2014-11-3 19:31:30 上传

《计算复杂性理论》
阅读权限: 18
需要: 5 个论坛币  [购买]

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏4 回帖

关键词：复杂性理论 Wiley LEY 复杂性 hide 书籍

书名:Theory of Computational Complexity
作者:Ding-Zhu Du
Department of Computer Science
University of Texas at Dallas
Richardson, TX
Ker-I Ko
Department of Computer Science
National Chiao Tung
页数514
出版社wiley
and index.
ISBN 978-1-118-30608-6 (cloth)
Preface ix
Notes on the Second Edition xv
Part I Uniform Complexity 1
1 Models of Computation and Complexity Classes 3
1.1 Strings, Coding, and Boolean Functions 3
1.2 Deterministic Turing Machines 7
1.3 Nondeterministic Turing Machines 14
1.4 Complexity Classes 18
1.5 Universal Turing Machine 25
1.6 Diagonalization 29
1.7 Simulation 33
Exercises 38
Historical Notes 43
2 NP-Completeness 45
2.1 NP 45
2.2 Cook’s Theorem 49
2.3 More NP-Complete Problems 54
2.4 Polynomial-Time Turing Reducibility 61
2.5 NP-Complete Optimization Problems 68
Exercises 76
Historical Notes 79

好书，支持一下

《计算复杂性理论》2th wiley2014最新书籍

thank you very much

感谢楼主分享

Theory of Computational Complexity

see..............

谢谢分享