| 書(shū)目名稱(chēng) | Notes on Introductory Combinatorics | | 編輯 | George Pólya,Robert E. Tarjan,Donald R. Woods | | 視頻video | http://file.papertrans.cn/669/668258/668258.mp4 | | 叢書(shū)名稱(chēng) | Progress in Computer Science and Applied Logic | | 圖書(shū)封面 |  | | 描述 | In the winter of 1978, Professor George P61ya and I jointly taught Stanford University‘s introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into | | 出版日期 | Book 1983 | | 關(guān)鍵詞 | Combinatorics; enumerative combinatorics; Matching; mathematics; Permutation; Polya; Ramsey theory | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4757-1101-1 | | isbn_softcover | 978-0-8176-3170-3 | | isbn_ebook | 978-1-4757-1101-1Series ISSN 2297-0576 Series E-ISSN 2297-0584 | | issn_series | 2297-0576 | | copyright | Springer Science+Business Media New York 1983 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-14 14:57
發(fā)表于 2025-3-21 18:49:10
