notes introductory combinatorics von pólya george (9 Ergebnisse)

Zustand: Good. Ältere Ausgabe. Ehemaliges Bibliotheksexemplar. Mit Bibliotheksstempel und Aufkleber am Buchrücken. Als übereignet gekennzeichnet.

Zustand: Good. Ältere Ausgabe. Ehemaliges Bibliotheksexemplar. Mit Bibliotheksstempel und Aufkleber am Buchrücken. Als übereignet gekennzeichnet.

Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 POL 9783764331238 Sprache: Englisch Gewicht in Gramm: 500.

Broschiert. Zustand: Gut. 23 cm 190 S. Broschiert. Sprache: Englisch, graph. Darst. Zustand: Sehr Gut, eher ungelesen (Innen); Einband (Außen) hat geringe bis leichte Gebrauchsspuren; * Die Photos sind original von uns erstellt worden, u.a. erkennbar an einem kleinen weißen Stück Papier im oberen Schnitt. Ab und an verwenden Suchmaschinen Verlagsphotos, bei den Portalen selbst, werden aber nur unsere Originalphotos gezeigt.

Zustand: Gut. Zustand: Gut | Seiten: 191 | Sprache: Englisch | Produktart: Bücher.

Zustand: New. In.

Taschenbuch. Zustand: Neu. Neuware -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 204 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Zustand: Brand New. 212 pages. 9.00x6.00x0.50 inches. In Stock.