《计算机程序设计艺术,卷4A：组合算法（一）（英文版）》Donald E. Knuth | PDF下载|ePub下载

Chapter 7—Combinatorial Searching 1
7.1.　Zeros and Ones 47
7.1.1.　Boolean Basice 　47
7.1.2.　Boolean Evaluation　　96
7.1.3　Bitwise Tricks and Techniques 133
7.1.4.　Binary Decision Diagrams　　202
7.2.　Generating All Possibilities 281
7.2.1.　Generating Basic Combinatorial Patterns 　　281
7.2.1.1.　Generating all n-tuples　　281
7.2.1.2.　Generating all permutations　　319
7.2.1.3.　Generating all combinations　　355
7.2.1.4.　Generating all partitions　　390
7.2.1.5.　Generating all set partitions 　　415
7.2.1.6.　Generating all trees　　440
7.2.1.7.　History and further references 　　486
Answers 59 Exercises　　514
Appendix A—Tables of Numerical quantities　　818
1. Fundamental Constants(decimal)　　818
2. Fundamental Constants(hexadecimal)　　819
3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers　　820
Appendix B—Index to Notations　　822
Appendix C—Index to Algorithms and Theorems　　828
Appendix D—Index to Combinatorial Problems　　830
Index and Glossary　　834
· · · · · ·