Computational Complexity (Paperback)
Christos H. Papadimitriou
- 出版商: Pearson
- 出版日期: 1993-12-10
- 定價: USD $169.60
- 售價: $1,100
- 貴賓價: 9.8 折 $1,078
- 語言: 英文
- 頁數: 523
- 裝訂: Paperback
- ISBN: 0201530821
- ISBN-13: 9780201530827
貴賓價: $4,727Distributed Systems: Principles and Paradigms, 2/e（Paperback）（美國精裝原版）
貴賓價: $970Introduction to Algorithms, 2/e
貴賓價: $1,045Operating System Principles, 7/e(IE) (美國版ISBN:0471694665－Operating System Concepts, 7/e) (平裝)
貴賓價: $1,140Computer Organization and Design: The Hardware/Software Interface, 3/e(IE) (美國版ISBN:1558606041)
貴賓價: $1,235Computer Architecture: A Quantitative Approach, 4/e (Paperback)
貴賓價: $1,098Introduction to the Theory of Computation, 2/e (Hardcover)
貴賓價: $4,609Compilers: Principles, Techniques, and Tools, 2/e [Hardcover]
貴賓價: $829Turing :A Novel About Computation (Paperback)
貴賓價: $1,140C++ Primer, 4/e (Paperback)
貴賓價: $1,176Compilers: Principles, Techniques, and Tools, 2/e (IE-Paperback)
貴賓價: $1,330OpenGL SuperBible: Comprehensive Tutorial and Reference, 4/e
This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.
2. Turing Machines.
2. First Order Logic.
3. Undecidability in Logic.
III. P AND NP.
2. Reductions and Completeness.
3. NP-Complete Problems.
4. coNP and Function Problems.
5. Randomized Computation.
8. On P vs. NP.
IV. INSIDE P.
2. Logarithmic Space.
V. BEYOND NP.
2. Computation That Counts.
3. Polynomial Space.
4. A Glimpse Beyond. 0201530821T04062001