Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Notes on Introductory Combinatorics

Notes on Introductory Combinatorics
Catalogue Information
Field name Details
Dewey Class 511.6
Title Notes on Introductory Combinatorics ([Ebook]) / by George Pólya, Robert E. Tarjan, Donald R. Woods.
Author Pólya, George. , 1887-1985
Added Personal Name Tarjan, Robert E.
Woods, Donald R.
Other name(s) SpringerLink (Online service)
Edition statement Reprint of the 1983 edition
Publication Boston : Birkhäuser , 2010.
Physical Details XII, 192 pages : online resource.
Series Modern Birkhäuser classics
ISBN 9780817649531
Summary Note 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):
Contents note 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.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users).
Internet Site http://dx.doi.org/10.1007/978-0-8176-4953-1
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 27754 Beginning of record . Catalogue Information 27754 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating27754
Quick Search