<電子ブック>
Notes on Introductory Combinatorics / by George Pólya, Robert E. Tarjan, Donald R. Woods
(Progress in Computer Science and Applied Logic. ISSN:22970584 ; 4)
版 | 1st ed. 2010. |
---|---|
出版者 | (Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser) |
出版年 | 2010 |
本文言語 | 英語 |
大きさ | XII, 192 p. 125 illus : online resource |
著者標目 | *Pólya, George author Tarjan, Robert E author Woods, Donald R author SpringerLink (Online service) |
件 名 | LCSH:Computer science LCSH:Discrete mathematics LCSH:Algorithms LCSH:Mathematics -- Data processing 全ての件名で検索 LCSH:Numerical analysis FREE:Theory of Computation FREE:Discrete Mathematics FREE:Algorithms FREE:Computational Mathematics and Numerical Analysis FREE:Numerical Analysis |
一般注記 | Combinations and Permutations -- Generating Functions -- Principle of Inclusion and Exclusion -- Stirling Numbers -- P#x00F3;lya#x2019;s Theory of Counting -- Outlook -- Midterm Examination -- Ramsey Theory -- Matchings (Stable Marriages) -- Matchings (Maximum Matchings) -- Network Flow -- Hamiltonian and Eulerian Paths -- Planarity and the Four-Color Theorem -- Final Examination Developed from the authors’ introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Pólya’s Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths. This introduction will provide students with a solid foundation in the subject. ---- "This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Pólya and Tarjan at Stanford University. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhäuser publishers produced a very pleasant text. One can count on [Pólya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory…[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading." —Mathematical Reviews (Review of the original hardcover edition) "The mathematical community welcomes this book as a final contribution to honour the teacher G.Pólya." —Zentralblatt MATH (Review of the original hardcover edition) HTTP:URL=https://doi.org/10.1007/978-0-8176-4953-1 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9780817649531 |
|
電子リソース |
|
EB00226817 |
書誌詳細を非表示
データ種別 | 電子ブック |
---|---|
分 類 | LCC:QA75.5-76.95 DC23:004.0151 |
書誌ID | 4000120073 |
ISBN | 9780817649531 |
類似資料
この資料の利用統計
このページへのアクセス回数:7回
※2017年9月4日以降