Bücher online kaufen
|
| Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt. |
Notes on Introductory Combinatorics
Langbeschreibung
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.
Inhaltsverzeichnis
Combinations and Permutations.- Generating Functions.- Principle of Inclusion and Exclusion.- Stirling Numbers.- P#x00F3;lya#x2019;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.
ISBN-13:
9780817649531
Veröffentl:
2009
Seiten:
192
Autor:
George Pólya
Serie:
4, Progress in Computer Science and Applied Logic
eBook Typ:
PDF
eBook Format:
EPUB
Kopierschutz:
1 - PDF Watermark
Sprache:
Englisch
34,99 €*
Lieferzeit: Sofort lieferbar
Alle Preise inkl. MwSt.