Notes on introductory combinatorics
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 suc...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Boston, MA :
Birkhäuser Boston
[20..].
Cham : Springer Nature |
| Edice: | Progress in Computer Science and Applied Logic
4 |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Notes on Introductory Combinatorics, Texte imprimé, 9780817649548 • Notes on introductory combinatorics, George Pólya, Robert E. Tarjan, Donald R. Woods, 1983, Boston, Birkhäuser, 1 vol. (190 p.), Progress in computer science, 0-8176-3123-2 |
| LEADER | 04435nam a22003617a 4500 | ||
|---|---|---|---|
| 001 | 942774 | ||
| 008 | 110106q2000 xx ||| |||| 00| 0 eng d | ||
| 009 | PPN149049218 | ||
| 020 | |a 9780817649531 | ||
| 041 | 0 | |a eng | |
| 082 | |a 004.0151 | ||
| 100 | 1 | |a Pólya, George, |d 1887-1985. | |
| 245 | 1 | 0 | |a Notes on introductory combinatorics |c by George Pólya, Robert E. Tarjan, Donald R. Woods. |
| 260 | |a Boston, MA : |b Birkhäuser Boston. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Progress in Computer Science and Applied Logic |v 4 |x 2297-0584 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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). | ||
| 700 | 1 | |a Tarjan, Robert E. |4 aut | |
| 700 | 1 | |a Woods, Donald R. |4 aut | |
| 776 | 0 | |t Notes on Introductory Combinatorics |b Texte imprimé |z 9780817649548 | |
| 776 | 0 | |0 025445499 |t Notes on introductory combinatorics |f George Pólya, Robert E. Tarjan, Donald R. Woods |d 1983 |c Boston |n Birkhäuser |p 1 vol. (190 p.) |s Progress in computer science |z 0-8176-3123-2 | |
| 856 | 4 | |u https://doi.org/10.1007/978-0-8176-4953-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://doi.org/10.1007/978-0-8176-4953-1 |z Accès sur la plateforme de l'éditeur (Springer) | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-7LZDS314-P |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747832803 |u https://ezproxy.univ-orleans.fr/login?url=https://dx.doi.org/10.1007/978-0-8176-4953-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750850221 |u https://ezproxy.insa-cvl.fr/login?qurl=https://dx.doi.org/10.1007/978-0-8176-4953-1 |z Accès INSA CVL | |
| 997 | |0 942774 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||