この情報を出力する

このページのリンク

引用にはこちらのURLをご利用ください

他の検索サイト

利用統計

  • このページへのアクセス：49回
  • 貸出数：19回
    (1年以内の貸出数：0回)

＜図書＞
Introduction to algorithms

責任表示 Thomas H. Cormen ... [et al.]
データ種別 図書
版 2nd ed
出版情報 Cambridge, Mass. : MIT Press
Boston ; New York : McGraw-Hill , c2001
本文言語 英語
大きさ xxi, 1180 p. : ill. ; 24 cm
概要 An extensively revised edition of a mathematically rigorous yet accessible introduction to algorithms.
The updated new edition of the classic Introduction to Algorithms is intended primarily for use in...undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects.In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use o
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness.The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.続きを見る

所蔵情報



理系図1F 開架 007.64/C 88 2003
026212005000312

MIT Press 理系図1F 開架 007.64/C 88 2001
031212009000290

MIT Press 理系図1F 開架 007.64/C 88 2007
031212009002623

書誌詳細

一般注記 Rev. ed. of: Introduction to algorithms / Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest. c1990
Includes bibliographical references (p. [1127]-1143) and index
Other authors: Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
著者標目 Cormen, Thomas H.
Leiserson, Charles Eric
Rivest, Ronald L.
Stein, Clifford
件　名 LCSH:Computer programming
LCSH:Computer algorithms
分　類 LCC:QA76.6
DC21:005.1
書誌ID 1000920952
ISBN 0262032937
NCID BA53014594
巻冊次 MIT Press ; ISBN:0262032937
McGraw-Hill ; ISBN:0070131511
: pbk : MIT Press ; ISBN:0262531968
登録日 2009.09.16
更新日 2009.09.18