Mega Dose
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Tour our stores


    Recently Viewed clear list


    Interviews | September 2, 2014

    Jill Owens: IMG David Mitchell: The Powells.com Interview



    David Mitchell's newest mind-bending, time-skipping novel may be his most accomplished work yet. Written in six sections, one per decade, The Bone... Continue »

    spacer
Qualifying orders ship free.
$23.75
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
2 Remote Warehouse Software Engineering- Algorithms

The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees, History of Combinatorial Generation

by

The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees, History of Combinatorial Generation Cover

 

Synopses & Reviews

Publisher Comments:

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 4

This latest fascicle covers the generation of all trees, a basic topic that has surprisingly rich ties to the first three volumes of The Art of Computer Programming. In thoroughly discussing this well-known subject, while providing 124 new exercises, Knuth continues to build a firm foundation for programming. To that same end, this fascicle also covers the history of combinatorial generation. Spanning many centuries, across many parts of the world, Knuth tells a fascinating story of interest and relevance to every artful programmer, much of it never before told. The story even includes a touch of suspense: two problems that no one has yet been able to solve.

Book News Annotation:

Continuing the work he began in 1962, the legendary Knuth (art of computer programming, Stanford U.) has turned to the art of creating fascicles as he created his magnum opus on analyzing algorithms; in this process he will produce a series of texts containing wholly new or revised material that will eventually become part of the greater comprehensive volume. Until that event, he provides 124 new exercises along with this text, in which he studies methods for running through all of the possibilities in some combinatorial universe. He includes the history of this facet of his work as he examines generating all n-tuples, permutations, combinations, partitions, set partitions, and trees. He includes references and answers to his exercises along with a glossary.
Annotation 2006 Book News, Inc., Portland, OR (booknews.com)

Book News Annotation:

Continuing the work he began in 1962, the legendary Knuth (art of computer programming, Stanford U.) has turned to the art of creating fascicles as he created his magnum opus on analyzing algorithms; in this process he will produce a series of texts containing wholly new or revised material that will eventually become part of the greater comprehensive volume. Until that event, he provides 124 new exercises along with this text, in which he studies methods for running through all of the possibilities in some combinatorial universe. He includes the history of this facet of his work as he examines generating all n-tuples, permutations, combinations, partitions, set partitions, and trees. He includes references and answers to his exercises along with a glossary. Annotation ©2006 Book News, Inc., Portland, OR (booknews.com)

Synopsis:

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 Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e

About the Author

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.

Table of Contents

Chapter 7 Combinatorial Searching 1

7.2. Generating All Possibilities 1

7.2.1. Generating Basic Combinatorial Patterns 1

7.2.1.1. Generating all n-tuples 1

7.2.1.2. Generating all permutations 1

7.2.1.3 Generating all combinations 1

7.2.1.4 Generating all partitions 1

7.2.1.5 Generating all set partitions 2

7.2.1.6 Generating all trees 2

7.2.1.7 History and further references 48

Answers to Exercises 76

Index and Glossary 112

Product Details

ISBN:
9780321335708
Author:
Knuth, Donald E.
Publisher:
Addison-Wesley Professional
Author:
Knuth, Donald Ervin
Location:
Upper Sadle River, N. J.
Subject:
Programming - Algorithms
Subject:
Computer algorithms
Subject:
Computer programming
Subject:
Software Engineering-Algorithms
Copyright:
Edition Number:
Volume 4
Edition Description:
Fascicle 4
Series:
Art of Computer Programming
Series Volume:
04
Publication Date:
February 2006
Binding:
TRADE PAPER
Grade Level:
Professional and scholarly
Language:
English
Illustrations:
Y
Pages:
128
Dimensions:
9.52x6.42x.32 in. .52 lbs.

Other books you might like

  1. The Art of Computer Programming,... New Trade Paper $24.75
  2. Art of Computer Programming, 3rd... Used Hardcover $120.00
  3. The Art of Computer Programming,... Used Trade Paper $15.50
  4. The Gospel of the Flying Spaghetti...
    Used Trade Paper $6.50
  5. Fight Club Politics: How... New Hardcover $23.95

Related Subjects

Business » Banking
Computers and Internet » Software Engineering » Algorithms
Computers and Internet » Software Engineering » Programming and Languages
Health and Self-Help » Health and Medicine » Medical Specialties
History and Social Science » Politics » General
Humanities » Philosophy » General

The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees, History of Combinatorial Generation New Trade Paper
0 stars - 0 reviews
$23.75 In Stock
Product details 128 pages Addison-Wesley Professional - English 9780321335708 Reviews:
"Synopsis" by ,

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 Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e

spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.