share_book
Envoyer cet article par e-mail

The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions

ou partager sur :

share_comment
Partager ce commentaire par e-mail

ou partager sur :

PRÊT A ACHETER?
(vous pouvez toujours annuler plus tard)


J'aime
The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions

The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions

  (Auteur)


Prix : Cet article n'a pas encore de prix  ask_price

Demande de cotation sur ""
Ce titre est nouveau dans notre fonds d'ouvrages et nous ne l'avons encore jamais vendu à ce jour.
Notre engagement: Vous obtenir le meilleur prix
Aussi nombreux que soient les titres que nous référençons, absolument rien n'est automatisé dans la fixation de nos prix; et plutôt que de convertir automatiquement le prix en euros et risquer de répercuter sur vous un prix artificiellement élevé, nous vous faisons un devis rapide après avoir vérifié les prix auprès de nos différents fournisseurs.
Cette étape de demande de cotation est rapide (généralement quelques heures) et vise à vous faire bénéficier en permanence du meilleur prix pour vos achats de livres.


Sur commande

Des articles qui pourraient aussi vous intéresser

    Description de "The Art of Computer Programming, Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms..."

    This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called "fascicles," which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4, Fascicle 0 This fascicle introduces what will become by far the longest chapter in "The Art of Computer Programming," a chapter on combinatorial algorithms that will itself fill three full-sized volumes. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs. Combinatorial patterns or arrangements solve vast numbers of practical problems, and modern approaches to dealing with them often lead to methods that are more than a thousand times faster than the straightforward procedures of yesteryear. This fascicle primes the pump for everything that follows in the chapter, discussing first the essential ideas of combinatorics and then introducing fundamental ideas for dealing efficiently with 0s and 1s inside a machine, including Boolean basics and Boolean function evaluation. As always, the author's exposition is enhanced by hundreds of new exercises, arranged carefully for self-instruction, together with detailed answers.

    Détails sur le produit

    • Reliure : Paperback
    • 240  pages
    • Dimensions :  1.8cmx16.2cmx24.0cm
    • Poids : 440.0g
    • Editeur :   Addison-Wesley Professional Paru le
    • ISBN :  0321534964
    • EAN13 :  9780321534965
    • Langue : Anglais

    D'autres livres de Donald E. Knuth

    The Art of Computer Programming, Volumes 1-4A Boxed Set (Box Set)

    The bible of all fundamental algorithms and the work that taught many of today�??s software developers most of what they know about computer programming. �??Byte, September 1995   Countless readers have spoken about the profound personal influence of Knuth�??s work. Scientists have marveled a...

    Prix : 2828 DH

    Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition)

    Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.   The Ar...

    Art of Computer Programming, Volume 3: Sorting and Searching (2nd Edition)

    Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.   The Ar...

    Voir tous les livres de Donald E. Knuth

    Commentaires sur cet article

    Personne n'a encore laissé de commentaire. Soyez le premier!

    Laisser un commentaire

    Rechercher des articles similaires par rayon

    Rechercher par thèmes associés

    This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called "fascicles," which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4, Fascicle 0 This fascicle introduces what will become by far the longest chapter in "The Art of Computer Programming," a chapter on combinatorial algorithms that will itself fill three full-sized volumes. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs. Combinatorial patterns or arrangements solve vast numbers of practical problems, and modern approaches to dealing with them often lead to methods that are more than a thousand times faster than the straightforward procedures of yesteryear. This fascicle primes the pump for everything that follows in the chapter, discussing first the essential ideas of combinatorics and then introducing fundamental ideas for dealing efficiently with 0s and 1s inside a machine, including Boolean basics and Boolean function evaluation. As always, the author's exposition is enhanced by hundreds of new exercises, arranged carefully for self-instruction, together with detailed answers.