Artboard 33atençãoArtboard 18atualizarconectividadeArtboard 42boletocarrinhocartãoArtboard 45cartão SaraivacelularArtboard 42Artboard 23checkArtboard 28Artboard 17?compararcompartilharcompartilhar ativoArtboard 28Artboard 43Artboard 49Artboard 47Artboard 15Artboard 32ebookArtboard 22Artboard 5Artboard 25Artboard 1Artboard 42Artboard 11fecharfilmesArtboard 23gamesArtboard 4Artboard 9Artboard 6hqimportadosinformáticaArtboard 7Artboard 3Artboard 12Artboard 25Artboard 34Artboard 43Artboard 44curtirArtboard 24Artboard 13livrosArtboard 24Artboard 31menumúsicaArtboard 27Artboard 30Artboard 36Artboard 44outrospapelariaArtboard 17Artboard 6Artboard 27Artboard 30Artboard 29Artboard 26Artboard 2Artboard 20Artboard 35estrelaestrela ativorelógiobuscaArtboard 50Artboard 26toda saraivaArtboard 40Artboard 21Artboard 10Artboard 37usuárioArtboard 46Artboard 33Artboard 8seta
e-book

Combinatorial Methods with Computer Applications (Cód: 9478282)

Gross, Jonathan L.

Taylor & Francis (Livros Digitais)

Ooops! Este produto não está mais a venda.
Mas não se preocupe, temos uma versão atualizada para você.

Ooopss! Este produto está fora de linha, mas temos outras opções para você.
Veja nossas sugestões abaixo!

R$ 173,85

em até 5x de R$ 34,77 sem juros

Total:

Em até 1x sem juros de


Crédito:
Boleto:
Cartão Saraiva:

Total:

Em até 5x sem juros de


Combinatorial Methods with Computer Applications

R$173,85

Descrição

Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.

After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation expressions, binomial coefficients, partitions and permutations, and integer methods. The author then focuses on graph theory, covering topics such as trees, isomorphism, automorphism, planarity, coloring, and network flows. The final chapters discuss automorphism groups in algebraic counting methods and describe combinatorial designs, including Latin squares, block designs, projective planes, and affine planes. In addition, the appendix supplies background material on relations, functions, algebraic systems, finite fields, and vector spaces.

Paving the way for students to understand and perform combinatorial calculations, this accessible text presents the discrete methods necessary for applications to algorithmic analysis, performance evaluation, and statistics as well as for the solution of combinatorial problems in engineering and the social sciences.

Características

Produto sob encomenda Não
Marca Taylor & Francis (Livros Digitais)
Cód. Barras 9781584887447
Acabamento e-book
Início da Venda 19/04/2016
Territorialidade Internacional
Tamanho do Arquivo 9007
Proteção Drm Sim
Idioma 337
Número de Páginas 664 (aproximado)
Peso 0.00 Kg
AutorGross, Jonathan L.