Mendeley出力
＜図書＞
Mathematics for the analysis of algorithms
| 責任表示 | Daniel H. Greene, Donald E, Knuth |
|---|---|
| シリーズ | Progress in computer science ; no. 1 |
| データ種別 | 図書 |
| 出版情報 | Boston : Birkhäuser , c1981 |
| 本文言語 | 英語 |
| 大きさ | 107 p. ; 24 cm |
| 概要 | A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science cours... 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. 続きを見る |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
|
中央図 2B | 549.9/G 82/1 | 1981 |
|
068582181012953 |
|
書誌詳細
| 一般注記 | Bibliography: p. [81]-84 Includes index |
|---|---|
| 著者標目 | *Greene, Daniel H., 1955- Knuth, Donald Ervin, 1938- |
| 件 名 | LCSH:Electronic digital computers -- Programming
全ての件名で検索
LCSH:Algorithms |
| 分 類 | LCC:QA76.6 DC19:519.4 |
| 書誌ID | 1000625123 |
| ISBN | 3764330465 |
| NCID | BA0731167X |
| 巻冊次 | ISBN:3764330465 |
| 登録日 | 2009.09.14 |
| 更新日 | 2009.09.14 |