VT/m 22 december gratis verzending

 VGratis cadeautas bij elke bestelling

 V€ 5,- boektegoed cadeau vanaf € 25,-

Stanford Graphbase
ISBN
9780321606327
Uitgever
Van Ditmar Boekenimport B.V.
Druk vanaf
1e
Verschenen
01-01-1993
Taal
Engels
Bladzijden
592 pp.
Bindwijze
Paperback
Genre
Informatica & Exacte vakken
  • Share
  • Share
  • Share
  • Share

Stanford Graphbase

A Platform for Combinatorial Computing, the

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
€81,95
Exemplaren:
Nieuw

Prijs:
€ 81,95
Verkrijgbaar in
Centraal landelijk magazijn
Voorraad:
-
Levertijd:
Tijdelijk niet leverbaar
* Voorraad uit het 'Centraal landelijk magazijn' is leverbaar vanuit een centraal logistiek centrum in Nederland, hiervandaan wordt het artikel naar de klant of de boekhandel gestuurd. De getoonde voorraad in de boekhandel wordt meerdere malen per dag bijgewerkt. Het kan echter voorkomen dat een artikel in de tussentijd uitverkocht is. Wilt u zeker weten dat een boek op voorraad is, verzoeken wij u contact op te nemen met de boekhandel.

Loading...

.
Waarom Libris
Boekbestellingen worden t/m 22 december 2017 GRATIS thuisbezorgd.
Kies uit meer dan een miljoen artikelen, waaronder ruim 25.000 Nederlandse ebooks.
Thuis bestellen en bezorgen of afhalen en betalen in de boekhandel.
Ruim 85.000 boeken op werkdagen voor 23.00 besteld, de volgende dag bezorgd
Volg uw bestelling via Track & Trace van PostNL
Bijna 100 aangesloten kwaliteitsboekhandels.
pro-mbookslibr2 : libris