Acheter d'occasion
EUR 5,40
+ EUR 2,99 (livraison)
D'occasion: Bon | Détails
Vendu par -betterworldbooks-
État: D'occasion: Bon
Commentaire: Expedier des Etats-Unis. Distribution privu en 2-3 semaines. Nous proposons la communication par e-mail en francais. Ancien livre de bibliothèque. Peut contenir des étiquettes « de bibliothèque » Le dos et les coins peuvent montrer des signes d'usure. Les pages peuvent inclure des notes et quelques signes de feutre. Sous garantie de remboursement complet. Plus de plus d'un million clients satisfaits! Votre alphabétisation dans le monde achat avantages!
Vous l'avez déjà ?
Repliez vers l'arrière Repliez vers l'avant
Ecoutez Lecture en cours... Interrompu   Vous écoutez un extrait de l'édition audio Audible
En savoir plus
Voir cette image

The Art of Computer Programming, Volume 2: Seminumerical Algorithms (Anglais) Relié – 1 janvier 1981

Voir les formats et éditions Masquer les autres formats et éditions
Prix Amazon Neuf à partir de Occasion à partir de
"Veuillez réessayer"
EUR 48,19 EUR 5,40

Il y a une édition plus récente de cet article:

Offres spéciales et liens associés

Descriptions du produit

Quatrième de couverture

Third Edition
now available!Volume 2 provides a comprehensive interface between computer programming and numerical analysis. It includes a substantial amount of complexity theory, number theory, and statistics.


Biographie de l'auteur

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.

Détails sur le produit

En savoir plus sur l'auteur

Découvrez des livres, informez-vous sur les écrivains, lisez des blogs d'auteurs et bien plus encore.

Commentaires en ligne

Il n'y a pas encore de commentaires clients sur
5 étoiles
4 étoiles
3 étoiles
2 étoiles
1 étoiles

Commentaires client les plus utiles sur (beta) 14 commentaires
18 internautes sur 21 ont trouvé ce commentaire utile 
Can we shave a constant off this running time? 3 avril 1998
Par Un client - Publié sur
Format: Relié
To an ordinary computer scienist, an algorithm is polynomial-time. To Knuth, it takes 3*n^2 + 17*x + 5 steps on MIX, not counting the time required to display the output, but there might be a way to reduce the number of steps to 3*n^2 + 17*x + 4. For precision and rigor, the Art of Computer Programming books are hard to beat. But, at least for an undergraduate CS student like me, they are slow going. Their greatest value seems to be as a reference for mathematical ideas needed in analysis of algorithms: recurrence relations, combinatorial identities, etc. Like the Bible, the TAOCP books are good to have around even if you don't plan to read them.
7 internautes sur 7 ont trouvé ce commentaire utile 
Numbers: random generations and arithmetic 10 août 2006
Par Vincent Poirier - Publié sur
Format: Relié
Volume 2 of "The Art of Computer Programming" is about random numbers and also about relearning one of the three Rs from grade school, viz. arithmetic. Each topic gets one chapter.

When you generate random numbers in Excel, or VBA, or Perl, or C using functions packaged with the software, you are really using a deterministic algorithm that is not random at all; the results do however look random and so we call them "pseudorandom".

Chapter 3 contains four main sections. First a section devoted to the linear congruence method (Xn+1=(aXn + c) mod m) of generating a pseudorandom sequence; with subsections on how to choose good values for a, c, and m. Second we get a section about how to test sequences to find if they are acceptably random or not. Third we find a section on other methods, expanding on linear congruence. Finally in a particularly fascinating section, DK provides a rigorous definition of randomness.

I haven't looked much at chapter 4 yet, on arithmetic. In it Knuth covers positional arithmetic, floating point arithmetic, multiplication and division at the machine level, prime numbers and efficient ways of investigating the primeness of very large numbers.

Again, DK is thorough and methodical. Again this is not a for dummies book. Again it is about theorems, algorithms, mechanical processes, and timeless truths. Again the exercises are a fascinating blend of the practical (investigate the random generating functions on the computers in your office) to the mathematical (he asks readers to formally prove many of the theorems he cites). And yes, again Knuth uses MIX, that wonderfully archaic fictional 60s machine language. But that should not stop readers; I use Perl.

Vincent Poirier, Tokyo
12 internautes sur 14 ont trouvé ce commentaire utile 
State of the art reference for computer scientists 7 octobre 1997
Par Henrik Sandin - Publié sur
Format: Relié
This book offers a stringent treatment of random number generators and algorithms not found anywhere else. It is particularly valuable for those that deal with encryption and the analysis of cyphers. The exercises add admirably to the text. References to other books in the field are extensive. The book is written in a non-wordy, but still very readable style, making it accessible to serious computer scientists at all levels. A mathematical background is necessary.
4 internautes sur 4 ont trouvé ce commentaire utile 
Fascinating 5 mars 1998
Par Un client - Publié sur
Format: Relié
Of course this is a classic programming text, but the book is fascinating from a mathematical point as well. The discussion of random number generation is worth the price alone. Also neat is the discussion of why numbers with lower initial digits are 'more common' in practice than those with higher initial digits, a topic I've never seen treated elsewhere.
10 internautes sur 13 ont trouvé ce commentaire utile 
Difficult book, great source for exercises. 1 avril 1998
Par Un client - Publié sur
Format: Relié
Knuth's presentation is obscure and difficult, but he's awfully comprehensive. If you want to learn algorithms, or even if you're looking for a reference, there are many better choices (especially Introduction to Algorithms, the CLR book). That said, I can't point to a more thorough book. Among other things, The Art of Computer Programming series is a great source of problems if you're teaching, learning, or just looking for fun. It might be worth the price just for that.
Ces commentaires ont-ils été utiles ? Dites-le-nous

Rechercher des articles similaires par rubrique


Souhaitez-vous compléter ou améliorer les informations sur ce produit ? Ou faire modifier les images?