| 000 -LEADER |
|---|
| fixed length control field |
03954nam a22005295i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20140310151442.0 |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION |
|---|
| fixed length control field |
cr nn 008mamaa |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
100301s2010 xxu| s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780817649531 |
|
978-0-8176-4953-1 |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA164-167.2 |
| 082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
511.6 |
| Edition number |
23 |
| 264 #1 - |
|---|
| -- |
Boston : |
| -- |
Birkhäuser Boston, |
| -- |
2010. |
| 912 ## - |
|---|
| -- |
ZDB-2-SMA |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Pólya, George. |
| Relator term |
author. |
| 245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE |
|---|
| Title |
Notes on Introductory Combinatorics |
| Medium |
[electronic resource] / |
| Statement of responsibility, etc |
by George Pólya, Robert E. Tarjan, Donald R. Woods. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
1st. |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
XII, 192 p. 125 illus. |
| Other physical details |
online resource. |
| 440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE |
|---|
| Title |
Modern Birkhäuser Classics |
| 505 0# - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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) |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Computer software. |
|
|---|
| Topical term or geographic name as entry element |
Electronic data processing. |
|
|---|
| Topical term or geographic name as entry element |
Computer science |
| General subdivision |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Algorithms. |
|
|---|
| Topical term or geographic name as entry element |
Combinatorics. |
|
|---|
| Topical term or geographic name as entry element |
Mathematics. |
|
|---|
| Topical term or geographic name as entry element |
Combinatorics. |
|
|---|
| Topical term or geographic name as entry element |
Algorithms. |
|
|---|
| Topical term or geographic name as entry element |
Algorithm Analysis and Problem Complexity. |
|
|---|
| Topical term or geographic name as entry element |
Computational Mathematics and Numerical Analysis. |
|
|---|
| Topical term or geographic name as entry element |
Numeric Computing. |
| 700 1# - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Tarjan, Robert E. |
| Relator term |
author. |
|
|---|
| Personal name |
Woods, Donald R. |
| Relator term |
author. |
| 710 2# - ADDED ENTRY--CORPORATE NAME |
|---|
| Corporate name or jurisdiction name as entry element |
SpringerLink (Online service) |
| 773 0# - HOST ITEM ENTRY |
|---|
| Title |
Springer eBooks |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY |
|---|
| Display text |
Printed edition: |
| International Standard Book Number |
9780817649524 |
| 856 40 - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
http://dx.doi.org/10.1007/978-0-8176-4953-1 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
E-Book |
