Computational Complexity pdf epub mobi txt 電子書下載2025

簡體網頁||繁體網頁

☆☆☆☆☆

出版者:Addison-Wesley

作者:Christos H. Papadimitriou

出品人:

頁數:500

译者:

出版時間:1993-11-30

價格:GBP 105.99

裝幀:Paperback

isbn號碼:9780201530827

叢書系列:

圖書標籤:

計算復雜性
計算理論
Complexity
計算機
數學
MathComplexity
CS
課本

下載連結在頁面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製連結

想要找書就要到圖書目錄大全

book.wenda123.org

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

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.