Articles liés à Notes on Introductory Combinatorics
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 74,71
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Notes on Introductory Combinatorics
Image fournie par le vendeur
Notes on Introductory Combinatorics
Edité par
Birkhauser Boston Inc, 1990
ISBN 10 : 0817631704
ISBN 13 : 9780817631703
Ancien ou d'occasion
Soft cover
Vendeur : Repton and Clover, Norwich, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Soft cover. Etat : Very Good. 2nd Edition. 1990 second edition paperback in very good condition. No marks, clean and bright. The card cover has a little tanning to edges, minor shelf wear, otherwise fine. Items are dispatched the same or the following working day. Please note our excellent customer feedback. N° de réf. du vendeur 008325
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Notes on Introductory Combinatorics
Edité par
Birkhäuser Boston, 1990
ISBN 10 : 0817631704
ISBN 13 : 9780817631703
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 teen. N° de réf. du vendeur 5975335
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Notes on Introductory Combinatorics
Edité par
Birkhäuser Boston Jan 1990, 1990
ISBN 10 : 0817631704
ISBN 13 : 9780817631703
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - 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. 204 pp. Englisch. N° de réf. du vendeur 9780817631703
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Notes on Introductory Combinatorics
Edité par
Birkhäuser Boston, Birkhäuser Boston Jan 1990, 1990
ISBN 10 : 0817631704
ISBN 13 : 9780817631703
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9780817631703
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Notes on Introductory Combinatorics
Edité par
Birkhäuser Boston, Birkhäuser Boston, 1990
ISBN 10 : 0817631704
ISBN 13 : 9780817631703
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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. N° de réf. du vendeur 9780817631703
Quantité disponible : 1 disponible(s)
Image d'archives
Notes on Introductory Combinatorics
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 212 1st Edition. N° de réf. du vendeur 26318040
Quantité disponible : 4 disponible(s)
Image d'archives
Notes on Introductory Combinatorics
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 212. N° de réf. du vendeur 7562631
Quantité disponible : 4 disponible(s)
Image d'archives
Notes on Introductory Combinatorics
impression à la demandeVendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. PRINT ON DEMAND pp. 212. N° de réf. du vendeur 18318034
Quantité disponible : 4 disponible(s)
Image d'archives
Notes on Introductory Combinatorics
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : Brand New. 212 pages. 9.00x6.00x0.50 inches. In Stock. N° de réf. du vendeur zk0817631704
Quantité disponible : 1 disponible(s)
Image d'archives
Notes on Introductory Combinatorics
Edité par
Birkhäuser, 1990
ISBN 10 : 0817631704
ISBN 13 : 9780817631703
Ancien ou d'occasion
Paperback
Vendeur : dsmbooks, Liverpool, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur D8F0-0-M-0817631704-6
Quantité disponible : 1 disponible(s)