Notes on Introductory Combinatorics / Progress in Computer Science and Applied Logic Bd.4 (PDF)
(Sprache: Englisch)
In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a...
sofort als Download lieferbar
eBook (pdf)
Fr. 94.50
inkl. MwSt.
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Notes on Introductory Combinatorics / Progress in Computer Science and Applied Logic Bd.4 (PDF)“
In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.
Bibliographische Angaben
- Autoren: George Polya , Robert E. Tarjan , Donald R. Woods
- 2013, 1983, 193 Seiten, Englisch
- Verlag: Birkhäuser Boston
- ISBN-10: 1475711018
- ISBN-13: 9781475711011
- Erscheinungsdatum: 27.11.2013
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Grösse: 13 MB
- Mit Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kopierschutz
Dieses eBook können Sie uneingeschränkt auf allen Geräten der tolino Familie lesen. Zum Lesen auf sonstigen eReadern und am PC benötigen Sie eine Adobe ID.
Kommentar zu "Notes on Introductory Combinatorics / Progress in Computer Science and Applied Logic Bd.4"
0 Gebrauchte Artikel zu „Notes on Introductory Combinatorics / Progress in Computer Science and Applied Logic Bd.4“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Notes on Introductory Combinatorics / Progress in Computer Science and Applied Logic Bd.4".
Kommentar verfassen