Art of computer programming.Volume 4A,Combinatorial algorithms.Part 1

Chapter 7—Combinatorial Searching
　7.1.Zeros and Ones
    7.1.1.Boolean Basice
    7.1.2.Boolean Evaluation
    7.1.3.Bitwise Tricks and Techniques
    7.1.4.Binary Decision Diagrams
　7.2.Generating All Possibilities
    7.2.1.Generating Basic Combinatorial Patterns
    　7.2.1.1.Generating all n-tuples
    　7.2.1.2.Generating all permutations
    　7.2.1.3.Generating all combinations
    　7.2.1.4.Generating all partitions
    　7.2.1.5.Generating all set partitions
    　7.2.1.6.Generating all trees
    　7.2.1.7.History and further references
Answers 59 Exercises
Appendix A—Tables of Numerical quantities
    1.Fundamental Constants（decimal）
    2.Fundamental Constants（hexadecimal）
    3.Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers
Appendix B—Index to Notations
Appendix C—Index to Algorithms and Theorems
Appendix D—Index to Combinatorial Problems
Index and Glossary