ý kiến bạn đọc

Introduction to Algorithms: 2nd edition

Nhóm Tác giả: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein

Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are ...

The algorithm design manual: 2nd ed.

Tác giả: Steven S. Skiena

This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both student and computer professionals. It is devided into two parts: Techniques and Resources. The former is a general guide to techniques for the design and analysis of computer ...

The art of computer programming : volume 4 : generating all trees history of combinatorial generation, fascicle 4

Tác giả: Donald E. Knuth

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 ...

The art of Computer Programming : volume 4 : generating all combinations and partitions, fascicle 3

Tác giả: Donald E. Knuth

This fascicle includes a bounty of creative exercises, as well as intriguing challenges posed by yet-unsolved questions.

The art of Computer Programming : volume 4 : generating all tuples and permutations, fascicle 2

Tác giả: Donald E. Knuth

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 fasicles of Volume 4, Knuth illuminates ...