- 5 resultados
menor preço: € 44,21, preço mais alto: € 80,24, preço médio: € 67,94
1
Notes on Introductory Combinatorics
Encomendar
no/na Springer.com
€ 80,24
Envio: € 0,001
EncomendarLink patrocinado

Notes on Introductory Combinatorics - novo libro

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… mais…

Nr. 978-0-8176-3170-3. Custos de envio:Worldwide free shipping, , DE. (EUR 0.00)
2
Notes on Introductory Combinatorics - George Polya|Robert E. Tarjan|Donald R. Woods
Encomendar
no/na AbeBooks.de
€ 70,33
Envio: € 0,001
EncomendarLink patrocinado

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

Notes on Introductory Combinatorics - Livro de bolso

1990, ISBN: 0817631704

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

NEW BOOK. Custos de envio: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
Encomendar
no/na amazon.co.uk
£ 55,96
(aproximadamente € 64,93)
Envio: € 5,571
EncomendarLink patrocinado
Polya, George:
Notes on Introductory Combinatorics: 4 (Progress in Computer Science and Applied Logic) - Livro de bolso

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… mais…

Custos de envio: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
Encomendar
no/na Hugendubel.de
€ 79,99
Envio: € 7,501
EncomendarLink patrocinado
George Polya/ Robert E. Tarjan/ Donald R. Woods:
Notes on Introductory Combinatorics - Livro de bolso

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… mais…

0817631704. Custos de envio: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
Encomendar
no/na AbeBooks.de
€ 44,21
Envio: € 28,241
EncomendarLink patrocinado
Polya, George:
Notes on Introductory Combinatorics - Livro de bolso

1990, ISBN: 0817631704

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

NOT NEW BOOK. Custos de envio: EUR 28.24 GoldBooks, Austin, TX, U.S.A. [71454205] [Rating: 5 (von 5)]

1Como algumas plataformas não transmitem condições de envio e estas podem depender do país de entrega, do preço de compra, do peso e tamanho do artigo, de uma possível adesão à plataforma, de uma entrega directa pela plataforma ou através de um terceiro fornecedor (Marketplace), etc., é possível que os custos de envio indicados pelo eurolivro não correspondam aos da plataforma ofertante.

Dados bibliográficos do melhor livro correspondente

Pormenores referentes ao livro
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.

Dados detalhados do livro - Notes on Introductory Combinatorics


EAN (ISBN-13): 9780817631703
ISBN (ISBN-10): 0817631704
Livro de capa dura
Livro de bolso
Ano de publicação: 1990
Editor/Editora: Birkhäuser Boston
212 Páginas
Peso: 0,325 kg
Língua: eng/Englisch

Livro na base de dados desde 2007-03-26T20:29:19+01:00 (Lisbon)
Página de detalhes modificada pela última vez em 2024-03-06T18:52:04+00:00 (Lisbon)
Número ISBN/EAN: 9780817631703

Número ISBN - Ortografia alternativa:
0-8176-3170-4, 978-0-8176-3170-3
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: georg polya, polya george, donald woods, roberts, pólya george, robert
Título do livro: applied combinatorics, notes introductory combinatorics, combinatorics first course


Dados da editora

Autor: George Polya; Robert E. Tarjan; Donald R. Woods
Título: Progress in Computer Science and Applied Logic; Notes on Introductory Combinatorics
Editora: Birkhäuser; Birkhäuser Boston
193 Páginas
Ano de publicação: 1990-01-01
Boston; MA; US
Língua: 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 arquivar...