分享给好友:
Computational Complexity Christos Papadimitriou
Computational Complexity
Christos Papadimitriou
Offers a comprehensive treatment of the theory of algorithms and complexity. 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, and more.
500 pages, notes, references
| 介质类型 | 图书 Paperback Book (平装胶订图书) |
| 已发行 | 1993年11月30日 |
| 原始发行日期 | 1994 |
| ISBN13 | 9780201530827 |
| 出版商 | Pearson Education (US) |
| 页数 | 544 |
| 商品尺寸 | 171 × 246 × 30 mm · 802 g |
![Cover for Christos Papadimitriou · Internet and Network Economics: 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008. Proceedings - Information Systems and Applications, incl. Internet / Web, and HCI (Paperback Book) [2008 edition] (2008)](https://imusic.com.cn/local-image/images/item/original/844/9783540921844.jpg?christos-papadimitriou-2008-internet-and-network-economics-4th-international-workshop-wine-2008-shanghai-china-december-17-20-2008-proceedings-information-systems-and-applications-incl-internet-web-and-hci-paperback-book&class=scaled&v=1573218982)
