000 04066nam a22005535i 4500
001 u370426
003 SIRSI
005 20160812080032.0
007 cr nn 008mamaa
008 100301s2010 xxu| s |||| 0|eng d
020 _a9780817649531
_9978-0-8176-4953-1
040 _cMX-MeUAM
050 4 _aQA164-167.2
082 0 4 _a511.6
_223
100 1 _aPólya, George.
_eauthor.
245 1 0 _aNotes on Introductory Combinatorics
_h[recurso electrónico] /
_cby George Pólya, Robert E. Tarjan, Donald R. Woods.
250 _a1st.
264 1 _aBoston :
_bBirkhäuser Boston,
_c2010.
300 _aXII, 192 p. 125 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aModern Birkhäuser Classics
505 0 _aCombinations 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.
520 _aDeveloped 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)
650 0 _aMathematics.
650 0 _aComputer software.
650 0 _aElectronic data processing.
650 0 _aComputer science
_xMathematics.
650 0 _aAlgorithms.
650 0 _aCombinatorics.
650 1 4 _aMathematics.
650 2 4 _aCombinatorics.
650 2 4 _aAlgorithms.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputational Mathematics and Numerical Analysis.
650 2 4 _aNumeric Computing.
700 1 _aTarjan, Robert E.
_eauthor.
700 1 _aWoods, Donald R.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780817649524
830 0 _aModern Birkhäuser Classics
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-0-8176-4953-1
596 _a19
942 _cLIBRO_ELEC
999 _c198306
_d198306