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

Psychopharmacology Monograph (Cód: 9245598)

Gordon, Peter; Sedgewick,Robert; GORDON, PETER; Flajolet,philippe

Addison-Wesley

Vendido e entregue por Saraiva

Este produto está temporariamente indisponível no site, mas não se preocupe, você pode reservá-lo para retirada em uma loja física!

Reserve seu produto na loja para retirada em até 1 hora.
Ops! Este produto está temporariamente indisponível. Mas não se preocupe, nós avisamos quando ele chegar.
Ops! Este produto está temporariamente indisponível. Mas não se preocupe, nós avisamos quando ele chegar.

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$ 559,50

em até 10x de R$ 55,95 sem juros
Cartão Saraiva: 1x de R$ 531,53 (-5%)

Total:

Em até 1x sem juros de


Crédito:
Boleto:
Cartão Saraiva:

Total:

Em até 10x sem juros de


Psychopharmacology Monograph

R$559,50

Descrição

People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically.... The appearance of this long-awaited book is therefore most welcome. Its authors are not only worldwide leaders of the field, they also are masters of exposition. --D. E. Knuth This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatorics, as well as from classical computer science material, including algorithms and data structures. They focus on average-case or probabilistic analysis, although they also cover the basic mathematical tools required for worst-case or complexity analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms. Despite the large interest in th 'People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically.... The appearance of this long-awaited book is therefore most welcome. Its authors are not only worldwide leaders of the field, they also are masters of exposition.' --D. E. Knuth This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatorics, as well as from classical computer science material, including algorithms and data structures. They focus on 'average-case' or 'probabilistic' analysis, although they also cover the basic mathematical tools required for 'worst-case' or 'complexity' analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms. Despite the large interest in the mathematical analysis of algorithms, basic information on methods and models in widespread use has not been directly accessible for work or study in the field. The authors here address this need, combining a body of material that gives the reader both an appreciation for the challenges of the field and the requisite background for keeping abreast of the new research being done to meet these challenges. Highlights: Thorough, self-contained coverage for students and professionals in computer science and mathematics Focus on mathematical techniques of analysis Basic preparation for the advanced results covered in Knuth's books and the research literature Classical approaches and results in the analysis of algorithms 020140009XB04062001

Características

Produto sob encomenda Não
Marca Addison-Wesley
Cód. Barras 9780201400090
Altura 22.86 cm
I.S.B.N. 9780201400090
Profundidade 3.05 cm
Referência 000070123
Acabamento Brochura
Ano da edição 1995
Idioma Inglês
Número de Páginas 512
Peso 0.62 Kg
Largura 15.24 cm
AutorGordon, Peter; Sedgewick,Robert; GORDON, PETER; Flajolet,philippe