この商品を友人に教える:
Limits of Computation: An Introduction to the Undecidable and the Intractable Edna E. Reiter 第1 版
価格
¥ 28.698
税抜
遠隔倉庫からの取り寄せ
発送予定日 年11月13日 - 年12月1日
クリスマスプレゼントは1月31日まで返品可能です
Edna E. Reiter の新しいリリースのお知らせを受け取る
iMusicのウィッシュリストに追加
Limits of Computation: An Introduction to the Undecidable and the Intractable
Edna E. Reiter
Limits of Computation: An Introduction to the Undecidable and the Intractable offers a gentle introduction to the theory of computational complexity. It explains the difficulties of computation, addressing problems that have no algorithm at all and problems that cannot be solved efficiently.
The book enables readers to understand:
- What does it mean for a problem to be unsolvable or to be NP-complete?
- What is meant by a computation and what is a general model of a computer?
- What does it mean for an algorithm to exist and what kinds of problems have no algorithm?
- What problems have algorithms but the algorithm may take centuries to finish?
Developed from the authors' course on computational complexity theory, the text is suitable for advanced undergraduate and beginning graduate students without a strong background in theoretical computer science. Each chapter presents the fundamentals, examples, complete proofs of theorems, and a wide range of exercises.
279 pages, 79 black & white illustrations, 3 black & white tables
| メディア | 書籍 Hardcover Book (ハードカバー付きの本) |
| リリース済み | 2012年10月29日 |
| ISBN13 | 9781439882061 |
| 出版社 | Taylor & Francis Inc |
| ページ数 | 279 |
| 寸法 | 162 × 239 × 22 mm · 584 g |
| 言語 | 英語 |
