Bøger af Donald Knuth

Volume 4 of The Art of Computer Programming is devoted to the topic of Combinatorial Algorithms. Combinatorial algorithms are the methods that allow developers to cope with problems that involve zillions of cases. The explosive growth in the knowledge of such techniques has meant that several volumes are needed to describe them. 4C will be the next such volume. This fascicle, which will eventually form the first part of volume 4C, covers section 7.2.2.3 (Constraint Satisfaction Problems) of TAOCP. It follows the recently published volume 4B, which covered sections 7.2.2.1 (Dancing Links) and 7.2.2.2 (Satisfiability) of Knuth's grand project. Sudoku is a simple example of a Contstraint Satisfaction Problem (CSP). The problem to solve is putting a number in each square, with the constraint that no row, column, or block can contain a repeating number. CSPs traverse many domains in computer science, including in AI, where tasks including resource allocation, planning, scheduling, and decision-making all are formulated as CSPs. The latest chapter in Knuth's magnum opus! Will eventually form the first part of Volume 4B Covers Constraint Satisfaction Problems (CSP) - Sudoku is a simple example of a CSP CSPs traverse many domains in computer science, including in AI

Part of a multivolume work on the analysis of algorithms, this work provides a programmer's introduction to the MMIX, a RISC-based computer that replaces the original MIX, and describes the MMIX assembly language. It also presents material on subroutines, coroutines, and interpretive routines.

Offers an introduction to the field of seminumerical algorithms, with separate chapters on random numbers and arithmetic. This book summarizes the major paradigms and basic theory of such algorithms, thereby providing a comprehensive interface between computer programming and numerical analysis, and a fresh treatment of random number generators.

Knuth's multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth's analysis, while practicing programmers have successfully applied his "cookbook" solutions to their day-to-day problems. ¿The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient "review" of future volumes could almost be: "Knuth, Volume n has been published."-Data Processing Digest¿Knuth, Volume n has been published, where n = 4A.¿In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams.¿The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form.¿There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages.-Frank Ruskey, Department of Computer Science, University of Victoria¿The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer's library.

Presents basic programming concepts and techniques. This book focuses on the representation of information inside a computer, the structural relationships between data elements, and how to deal with them efficiently. It gives elementary applications to simulation, numerical methods, symbolic computing, software and system design.

Shows how a young couple turned on to pure mathematics and found total happiness. This title is intended for those who might enjoy an engaging dialogue on abstract mathematical ideas, and those who might wish to experience how new mathematics is created.