Constructive Combinatorics - Undergraduate Texts in Mathematics - Dennis W. Stanton - Bøker - Springer-Verlag New York Inc. - 9780387963471 - 15. mai 1986
Ved uoverensstemmelse mellom cover og tittel gjelder tittel

Dennis W. Stanton
Constructive Combinatorics - Undergraduate Texts in Mathematics 1st edition

Pris
NOK 639

Bestillingsvarer

Forventes levert 30. sep - 8. okt
Få varsel om nye utgivelser fra Dennis W. Stanton

Kundene våre sier:

14 dages returrett
Toppvurdering på Trustpilot
Legg til iMusic ønskeliste
eller

Ikke vurdert ennå

The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course.

186 pages, 3 black & white illustrations, biography

Media Bøker     Innbunden bok   (Bok med hard rygg og stivt omslag)
Utgitt 15. mai 1986
ISBN13 9780387963471
Utgivere Springer-Verlag New York Inc.
Antall sider 186
Mål 156 × 234 × 12 mm   ·   449 g
Språk Engelsk  

Mer fra samme **utgiver**

Se alt med Dennis W. Stanton