| 書目名稱 | Gems of Theoretical Computer Science |
| 編輯 | Uwe Sch?ning,Randall Pruim |
| 視頻video | http://file.papertrans.cn/382/381479/381479.mp4 |
| 概述 | Compilation of the most glorious episodes from the annals of theoretical computer science * Over 240 fascinating exercises with elegant solutions on the centrals themes of theoretical computer science |
| 圖書封面 |  |
| 描述 | While I was visiting Boston University during the 1996-97 academic year, I noticed a small book, written in German, on a shelf in Steve Homer‘s office. Curious, I borrowed it for my train ride home and began reading one of the chapters. I liked the style and format of the book so much that over the course of the next few months I frequently found myself reaching for it and working through one chapter or another. This was my introduction to Peden der Theoretischen Informatik. A few of my colleagues had also seen the book. They also found it inter- esting, but most of them did not read German well enough to read more than small portions of it enjoyably. I hope that the English version will rectify this situation, and that many will enjoy (and learn from) the English version as much as I enjoyed the German version. The front matter of this book says that it has been "translated, revised, and expanded." I should perhaps say a few words about each of these tasks. In translating the book, Ihave tried as much as possible to retain the feel of the original, which is somewhat less formal and impersonal than a typical text book yet relatively concise. I certainly hope that the "pleasure of t |
| 出版日期 | Book 1998 |
| 關(guān)鍵詞 | Kolmogorov complexity; Resolution; algorithms; complexity; complexity theory; computability; computer scie |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-60322-8 |
| isbn_softcover | 978-3-642-64352-1 |
| isbn_ebook | 978-3-642-60322-8 |
| copyright | Springer-Verlag Berlin Heidelberg 1998 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-5 02:02
發(fā)表于 2025-3-21 18:05:50
