Frete Grátis
  • Google Plus

Stanford Graphbase - A Platform For Combinatorial Computing, The (Cód: 9245283)

Knuth,Donald E

Addison Wesley

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$ 399,40 em até 10x de R$ 39,94 sem juros
Cartão Saraiva R$ 379,43 (-5%) em até 1x no cartão ou em até 12x de R$ 33,28 sem juros
Grátis

Cartão Saraiva
Quer comprar em uma loja física? Veja a disponibilidade deste produto
?

Entregas internacionais: Consulte prazos e valores de entrega para regiões fora do Brasil na página do Carrinho.

ou receba na loja com frete grátis

X

* Válido para compras efetuadas em dias úteis até às 18:00, horário de Brasília, com cartão de crédito e aprovadas na primeira tentativa.

Formas de envio Custo Entrega estimada
X Consulte as lojas participantes

Saraiva MegaStore Shopping Eldorado Av. Rebouças, 3970 - 1º piso - Pinheiros CEP: 05402-600 - São Paulo - SP

Descrição

The Stanford GraphBase: A Platform for Combinatorial Computing represents the first efforts of Donald E. Knuth's preparation for Volume Four of The Art of Computer Programming. The book's first goal is to use examples to demonstrate the art of literate programming. Each example provides a programmatic essay that can be read and enjoyed as readily as it can be interpreted by machines. In these essays/programs, Knuth makes new contributions to several important algorithms and data structures, so the programs are of special interest for their content as well as for their style. The book's second goal is to provide a useful means for comparing combinatorial algorithms and for evaluating methods of combinatorial computing. To this end, Knuth's programs offer standard, freely available sets of data - the Stanford GraphBase - that may be used as benchmarks to test competing methods. The data sets are both interesting in themselves and applicable to a wide variety of problem domains. With objective tests, Knuth hopes to bridge the gap between theoretical computer scientists and programmers who have real problems to solve.As with all of Knuth's writings, this book is appreciated not only for the author's unmatched insight, but also for the fun and the challenge of his work. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides sample programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost inexhaustible supply of challenging problems, some of which may lead to the discovery of new and improved algorithms, Knuth proposes friendly competitions. His own initial entries into such competitions are included in the book, and readers are challenged to do better. Features *Includes new contributions to our understanding of important algorithms and data structures *Provides a standard tool for evaluating combinatorial algorithms *Demonstrates a more readable, more practical style of programming *Challenges readers to surpass his own efficient algorithms 0201542757B04062001 The Stanford GraphBase: A Platform for Combinatorial Computing represents the first efforts of Donald E. Knuth's preparation for Volume Four of The Art of Computer Programming. The book's first goal is to use examples to demonstrate the art of literate programming. Each example provides a programmatic essay that can be read and enjoyed as readily as it can be interpreted by machines. In these essays/programs, Knuth makes new contributions to several important algorithms and data structures, so the programs are of special interest for their content as well as for their style. The book's second goal is to provide a useful means for comparing combinatorial algorithms and for evaluating methods of combinatorial computing. To this end, Knuth's programs offer standard, freely available sets of data - the Stanford GraphBase - that may be used as benchmarks to test competing methods. The data sets are both interesting in themselves and applicable to a wide variety of problem domains. With objective tests, Knuth hopes to bridge the gap between theoretical computer scientists and programmers who have real problems to solve. As with all of Knuth's writings, this book is appreciated not only for the author's unmatched insight, but also for the fun and the challenge of his work. He illustrates many of the most significant and most beautiful combinatorial algorithms that are presently known and provides sample programs that can lead to hours of amusement. In showing how the Stanford GraphBase can generate an almost inexhaustible supply of challenging problems, some of which may lead to the discovery of new and improved algorithms, Knuth proposes friendly competitions. His own initial entries into such competitions are included in the book, and readers are challenged to do better. Features Includes new contributions to our understanding of important algorithms and data structures Provides a standard tool for evaluating combinatorial algorithms Demonstrates a more readable, more practical style of programming Challenges readers to surpass his own efficient algorithms 0201542757B04062001

Características

Produto sob encomenda Sim
Marca Addison Wesley
Cód. Barras 9780321606327
Altura 23.11 cm
I.S.B.N. 9780321606327
Profundidade 3.30 cm
Referência 009512700
Acabamento Brochura
Ano da edição 1993
Idioma Inglês
Número de Páginas 592
Peso 1.00 Kg
Largura 18.54 cm
AutorKnuth,Donald E

Avaliações

Avaliação geral: 0

Você está revisando: Stanford Graphbase - A Platform For Combinatorial Computing, The

Stanford Graphbase - A Platform For Combinatorial Computing, The (Cód: 9245283) Stanford Graphbase - A Platform For Combinatorial ... (Cód: 9245283)
R$ 399,40
Stanford Graphbase - A Platform For Combinatorial Computing, The (Cód: 9245283) Stanford Graphbase - A Platform For Combinatorial ... (Cód: 9245283)
R$ 399,40