| 書(shū)目名稱(chēng) | Mathematics for the Analysis of Algorithms |
| 編輯 | Daniel H. Greene,Donald E. Knuth |
| 視頻video | http://file.papertrans.cn/627/626897/626897.mp4 |
| 概述 | A collection of some fundamental mathematical techniques that are required for the analysis of algorithms.Is very well written; the style and the mathematical exposition make the book pleasant to read |
| 叢書(shū)名稱(chēng) | Modern Birkh?user Classics |
| 圖書(shū)封面 |  |
| 描述 | .This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford.. |
| 出版日期 | Textbook 1990Latest edition |
| 關(guān)鍵詞 | algorithmic analysis; algorithms; asymptotic analysis; binomial identities; combinatorial analysis; compl |
| 版次 | 3 |
| doi | https://doi.org/10.1007/978-0-8176-4729-2 |
| isbn_softcover | 978-0-8176-4728-5 |
| isbn_ebook | 978-0-8176-4729-2Series ISSN 2197-1803 Series E-ISSN 2197-1811 |
| issn_series | 2197-1803 |
| copyright | Birkh?user Boston 1990 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 16:16
發(fā)表于 2025-3-21 18:47:43
