书名: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