000			03867nam a22004095i 4500
001			280749
003			MX-SnUAN
005			20220519074416.0
007			cr nn 008mamaa
008			150903s2010 xxu| o |||| 0|eng d
020			_a9780817649531 _99780817649531
024	7		_a10.1007/9780817649531 _2doi
035			_avtls000333684
039		9	_a201509030217 _bVLOAD _c201404130514 _dVLOAD _c201404092303 _dVLOAD _y201402041117 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aQA164-167.2
100	1		_9444004 _aPólya, George, _d1887-1985 _eautor
245	1	0	_aNotes on Introductory Combinatorics / _cby George Pólya, Robert E. Tarjan, Donald R. Woods.
250			_a1st.
264		1	_aBoston : _bBirkhäuser Boston, _c2010.
300			_axii, 192 páginas 125 ilustraciones _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aModern Birkhäuser Classics
500			_aSpringer eBooks
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)
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aTarjan, Robert E. _eautor _9305903
700	1		_aWoods, Donald R. _eautor _9305904
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9780817649524
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-8176-4953-1 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c280749 _d280749