Notes on Introductory Combinatorics

Notes on Introductory Combinatorics
-0 %
Print on Demand | Lieferzeit: Print on Demand - Lieferbar innerhalb von 3-5 Werktagen I

Unser bisheriger Preis:ORGPRICE: 69,54 €

Jetzt 69,53 €*

Alle Preise inkl. MwSt. | Versandkostenfrei
Artikel-Nr:
9780817649524
Veröffentl:
2009
Erscheinungsdatum:
17.11.2009
Seiten:
192
Autor:
George Pólya
Gewicht:
315 g
Format:
235x159x20 mm
Sprache:
Englisch
Beschreibung:

"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)

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 tools used for determining the performance of computer algorithms.
An affordable new softcover edition of a classic text
Introduction.- Combinations and Permutations.- Generating Functions.- Principle of Inclusion and Exclusion.- Stirling Numbers.- Pólya'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.- Bibliography.

Kunden Rezensionen

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.