- 5 Resultados
precio mínimo: € 44,21, precio máximo: € 80,24, precio promedio: € 67,94
1
Notes on Introductory Combinatorics
Pedir
por Springer.com
€ 80,24
Envío: € 0,001
PedirEnlace patrocinado

Notes on Introductory Combinatorics - libro nuevo

ISBN: 9780817631703

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 Professo… Más…

Nr. 978-0-8176-3170-3. Gastos de envío:Worldwide free shipping, , DE. (EUR 0.00)
2
Notes on Introductory Combinatorics - George Polya|Robert E. Tarjan|Donald R. Woods
Pedir
por AbeBooks.de
€ 70,33
Envío: € 0,001
PedirEnlace patrocinado

George Polya|Robert E. Tarjan|Donald R. Woods:

Notes on Introductory Combinatorics - Pasta blanda

1990, ISBN: 0817631704

[EAN: 9780817631703], Neubuch, [PU: Birkhäuser Boston], ENUMERATIVECOMBINATORICS MATCHING MATHEMATICS PERMUTATION RAMSEYTHEORY GEISTESWISSENSCHAFTEN ALLGEMEIN COMBINATORICS ENUMERATIVE PO… Más…

NEW BOOK. Gastos de envío:Versandkostenfrei. (EUR 0.00) moluna, Greven, Germany [73551232] [Rating: 4 (von 5)]
3
Notes on Introductory Combinatorics: 4 (Progress in Computer Science and Applied Logic) - Polya, George
Pedir
por amazon.co.uk
£ 55,96
(aprox. € 64,93)
Envío: € 5,571
PedirEnlace patrocinado
Polya, George:
Notes on Introductory Combinatorics: 4 (Progress in Computer Science and Applied Logic) - Pasta blanda

1990

ISBN: 9780817631703

Contributor: Tarjan, Robert E. Contributor: Woods, Donald R. Birkhäuser Boston, Paperback, Auflage: 1983, 204 Seiten, Publiziert: 1990-01-01T00:00:01Z, Produktgruppe: Book, 0.67 kg, Refer… Más…

Gastos de envío:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 5.57)
4
Notes on Introductory Combinatorics - George Polya/ Robert E. Tarjan/ Donald R. Woods
Pedir
por Hugendubel.de
€ 79,99
Envío: € 7,501
PedirEnlace patrocinado
George Polya/ Robert E. Tarjan/ Donald R. Woods:
Notes on Introductory Combinatorics - Pasta blanda

ISBN: 9780817631703

*Notes on Introductory Combinatorics* - Auflage 1983 / Taschenbuch für 79.99 € / Aus dem Bereich: Bücher, English,, International, Gebundene, Ausgaben Medien > Bücher nein Buch (kartonier… Más…

0817631704. Gastos de envío:Shipping in 3 days, , Versandkostenfrei nach Hause oder Express-Lieferung in Ihre Buchhandlung., zzgl. Versandkosten. (EUR 7.50)
5
Notes on Introductory Combinatorics - Polya, George
Pedir
por AbeBooks.de
€ 44,21
Envío: € 28,241
PedirEnlace patrocinado
Polya, George:
Notes on Introductory Combinatorics - Pasta blanda

1990, ISBN: 0817631704

[EAN: 9780817631703], Gebraucht, sehr guter Zustand, [PU: Birkhäuser], Very Good Copy. Customer Service Guaranteed, Books

NOT NEW BOOK. Gastos de envío: EUR 28.24 GoldBooks, Austin, TX, U.S.A. [71454205] [Rating: 5 (von 5)]

1Dado que algunas plataformas no nos comunican las condiciones de envío y éstas pueden depender del país de entrega, del precio de compra, del peso y tamaño del artículo, de una posible membresía a la plataforma, de una entrega directa por parte de la plataforma o a través de un tercero (Marketplace), etc., es posible que los gastos de envío indicados por eurolibro/terralibro no concuerden con los de la plataforma ofertante.

Datos bibliográficos del mejor libro coincidente

Detalles del libro
Notes on Introductory Combinatorics

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.

Detalles del libro - Notes on Introductory Combinatorics


EAN (ISBN-13): 9780817631703
ISBN (ISBN-10): 0817631704
Tapa dura
Tapa blanda
Año de publicación: 1990
Editorial: Birkhäuser Boston
212 Páginas
Peso: 0,325 kg
Idioma: eng/Englisch

Libro en la base de datos desde 2007-03-26T21:29:19+02:00 (Madrid)
Página de detalles modificada por última vez el 2024-03-06T19:52:04+01:00 (Madrid)
ISBN/EAN: 9780817631703

ISBN - escritura alterna:
0-8176-3170-4, 978-0-8176-3170-3
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: georg polya, polya george, donald woods, roberts, pólya george, robert
Título del libro: applied combinatorics, notes introductory combinatorics, combinatorics first course


Datos del la editorial

Autor: George Polya; Robert E. Tarjan; Donald R. Woods
Título: Progress in Computer Science and Applied Logic; Notes on Introductory Combinatorics
Editorial: Birkhäuser; Birkhäuser Boston
193 Páginas
Año de publicación: 1990-01-01
Boston; MA; US
Idioma: Inglés
85,59 € (DE)
87,99 € (AT)
94,50 CHF (CH)
Available
IX, 193 p. 3 illus.

BC; Hardcover, Softcover / Sozialwissenschaften allgemein; Interdisziplinäre Studien; Verstehen; Combinatorics; enumerative combinatorics; Matching; mathematics; Permutation; Polya; Ramsey theory; Humanities and Social Sciences; EA

1. Introduction.- 2. Combinations and Permutations.- 3. Generating Functions.- 4. Principle of Inclusion and Exclusion.- 5. Stirling Numbers.- 6. Pólya’s Theory of Counting.- 7. Outlook.- 8. Midterm Examination.- 9. Ramsey Theory.- 10. Matchings (Stable Marriages).- 11. Matchings (Maximum Matchings).- 12. Network Flow.- 13. Hamiltonian and Eulerian Paths.- 14. Planarity and the Four-Color Theorem.- 15. Final Examination.- 16. Bibliography.

< para archivar...