Product Description
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.
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 his time to the completion of these fascicles and the seven volumes to which they belong.

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 ISBN: 0321751043 Art of Computer Programming, Volume 4, Fascicle 4,The: Generating All Trees--History of Combinatorial Generation: Generating All Trees--History of Combinatorial Generation 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.

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 ISBN: 0321751043 Art of Computer Programming, Volume 4, Fascicle 3, The: Generating All Combinations and Partitions: Generating All Combinations and Partitions 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 3 This fascicle continues Knuth's authoritative chapter on combinatorial algorithms, ultimately to be included in Volume 4 of The Art of Computer Programming. The previous fascicle from Volume 4, which covered the generation of all tuples and permutations, is now complemented by techniques for generating all combinations and partitions. In Knuth's thorough discussion of these two topics, readers will find much that is new, as well as surprisingly rich ties to material in Volumes 1 through 3 and to other aspects of computer science and mathematics. As usual, this fascicle includes a bounty of creative exercises, as well as intriguing challenges posed by yet-unsolved questions.

From the Back Cover

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 t regular intervals. Each fascicle will encompass a section or more of wholly new or evised 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 2

This fascicle inaugurates the eagerly awaited publication of Knuth's The Art of Computer Programming, Volume 4: Combinatorial Algorithms. Part of what will be a long chapter on combinatorial searching, the fascicle begins his treatment of how to generate all possibilities. Specifically, it discusses the generation of all n-tuples, then extends those ideas to all permutations. Such algorithms provide a natural motivation by means of which many of the key ideas of combinatorial mathematics can be introduced and explored. In this and other fascicles of Volume 4, Knuth illuminates important theories by discussing related games and puzzles. Even serious programming can be fun.

From the Back Cover

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 t regular intervals. Each fascicle will encompass a section or more of wholly new or evised 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 1, Fascicle 1

This first fascicle updates The Art of Computer Programming, Volume 1, Third Edition: Fundamental Algorithms, and ultimately will become part of the fourth edition of that book. Specifically, it provides a programmer's introduction to the long-awaited MMIX, a RISC-based computer that replaces the original MIX, and describes the MMIX assembly language. The fascicle also presents new material on subroutines, coroutines, and interpretive routines.

Mateer and Coppock, leading researchers in Economics teaching who have consistently taught Principles over a combined forty-plus years, brought their innovative teaching experiences to this blockbuster text. They put economics into context by making it relatable through carefully crafted real-world examples, a problem-solving pedagogy that emphasizes economic decision-making, and a voice that speaks directly to students.

《查拉图斯特拉如是说》是尼采的里程碑式的作品，几乎包括了尼采的全部思想。《查拉图斯特拉如是说》以汪洋肆意的诗体写成，熔酒神的狂醉与日神的清醒于一炉，通过“超人”查拉图斯特拉之口宣传未来世界的启示，横扫了基督教所造成的精神奴性的方方面面，谱写了一曲自由主义的人性壮歌，在世界哲学史和诗歌史上均占有独特的不朽的地位。

By presenting evolutionary biology as a dynamic, ongoing research effort and organizing discussions around questions, this best-selling text helps you think like a scientist as you learn about evolution. The authors convey the excitement and logic of evolutionary science by introducing principles through recent and classical studies, and by emphasizing real-world applications.
In the Fifth Edition, co-author Jon Herron takes the lead in streamlining and updating content to reflect key changes in the field. The design and art program have also been updated for enhanced clarity

The annotated text of this modern classic. It assiduously illuminates the extravagant wordplay and the frequent literary allusions, parodies, and cross-references. Edited with a preface, introduction and notes by Alfred Appel, Jr.

Presents the basic concepts of linear algebra as a coherent part of mathematics. This new edition includes substantial revisions, new material on minimal polynomials and diagonalization, as well as a variety of new applications. Rich selection of examples and explanations, as well as a wide range of exercises at the end of every section.

This top-selling, theorem-proof book presents a careful treatment of the principle topics of linear algebra, and illustrates the power of the subject through a variety of applications. It emphasizes the symbiotic relationship between linear transformations and matrices, but states theorems in the more general infinite-dimensional case where appropriate. Chapter topics cover vector spaces, linear transformations and matrices, elementary matrix operations and systems of linear equations, determinants, diagonalization, inner product spaces, and canonical forms. For statisticians and engineers.

New edition extensively revised and updated
Covers new topics such as product spaces, quotient spaces, and dual spaces
Features new visually appealing format for both print and electronic versions
Includes almost three times the number of exercises as the previous edition
This best-selling textbook for a second course in linear algebra is aimed at undergrad math majors and graduate students. The novel approach taken here banishes determinants to the end of the book. The text focuses on the central goal of linear algebra: understanding the structure of linear operators on finite-dimensional vector spaces. The author has taken unusual care to motivate concepts and to simplify proofs. A variety of interesting exercises in each chapter helps students understand and manipulate the objects of linear algebra.
The third edition contains major improvements and revisions throughout the book. More than 300 new exercises have been added since the previous edition. Many new examples have been added to illustrate the key ideas of linear algebra. New topics covered in the book include product spaces, quotient spaces, and dual spaces. Beautiful new formatting creates pages with an unusually pleasant appearance in both print and electronic versions.
No prerequisites are assumed other than the usual demand for suitable mathematical maturity. Thus the text starts by discussing vector spaces, linear independence, span, basis, and dimension. The book then deals with linear maps, eigenvalues, and eigenvectors. Inner-product spaces are introduced, leading to the finite-dimensional spectral theorem and its consequences. Generalized eigenvectors are then used to provide insight into the structure of a linear operator.
From reviews of previous editions:
“… a didactic masterpiece”
—Zentralblatt MATH
“… a tour de force in the service of simplicity and clarity … The most original linear algebra book to appear in years, it certainly belongs in every undergraduate library.”
—CHOICE
The determinant-free proofs are elegant and intuitive.
—American Mathematical Monthly
“Clarity through examples is emphasized … the text is ideal for class exercises … I congratulate the author and the publisher for a well-produced textbook on linear algebra.”
—Mathematical Reviews

"Discrete Mathematics and its Applications, Seventh Edition", is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering. This renowned best-selling text, which has been used at over 500 institutions around the world, gives a focused introduction to the primary themes in a discrete mathematics course and demonstrates the relevance and practicality of discrete mathematics to a wide a wide variety of real-world applications!from computer science to data networking, to psychology, to chemistry, to engineering, to linguistics, to biology, to business, and to many other important fields.

In this timely work, Russell, philosopher, agnostic, mathematician, and renowned peace advocate, offers a brief yet insightful study of the conflicts between science and traditional religion during the last four centuries. Examining accounts in which scientific advances clashed with Christian doctrine or biblical interpretations of the day, from Galileo and the Copernican Revolution, to the medical breakthroughs of anesthesia and inoculation, Russell points to the constant upheaval and re-evaluation of our systems of belief throughout history. In turn, he identifies where similar debates between modern science and the Church still exist today. Michael Ruse's new introduction brings these conflicts between science and theology up to date, focusing on issues arising after the Second World War. This classic is sure to interest all readers of philosophy and religion, as well as those interested in Russell's thought and writings.

An international best-seller with more than one million copies in print and a winner of France’s Prix Goncourt, The Lover has been acclaimed by critics all over the world since its first publication in 1984.
Set in the prewar Indochina of Marguerite Duras’s childhood, this is the haunting tale of a tumultuous affair between an adolescent French girl and her Chinese lover. In spare yet luminous prose, Duras evokes life on the margins of Saigon in the waning days of France’s colonial empire, and its representation in the passionate relationship between two unforgettable outcasts.
Long unavailable in hardcover, this edition of The Lover includes a new introduction by Maxine Hong Kingston that looks back at Duras's world from an intriguing new perspective—that of a visitor to Vietnam today.

From amazon.com

Abe Ravitz, Cleveland Plain Dealer
"An intellectual heavyweight and a pure literary virtuoso, Milan Kundera takes some of Freud's most cherished complexes and irreverently whirls them about in acts of legerdemain that capture our darkest, deepest human passionsThe tales in Laughable Loves surprise and illuminateKundera's world is complex, full of mockeries and paradoxes. Life is often brutal and humiliating; it is often blasphemous, funny, irritating."

In writing this textbook, Mankiw has tried to put himself in the position of someone seeing economics for the first time. The author's conversational writing style presents the politics and science of economic theories to tomorrow's decision-makers.