دانلود کتاب The Art of Computer Programming

فهرست مطالب :

Mathematical Preliminaries Redux

Inequalities

Martingales

Tail inequalities from martingales

Applications

Statements that are almost sure, or even quite sure

Exercises

Chapter 7—Combinatorial Searching

7.2. Generating All Possibilities

7.2.1. Generating Basic Combinatorial Patterns

7.2.2. Backtrack Programming

Data structures

Walker’s method

Permutations and Langford pairs

Word rectangles

Commafree codes

Dynamic ordering of choices

Sequential allocation redux

Lists for the commafree problem

A general mechanism for doing and undoing

Backtracking through commafree codes

Running time estimates

*Estimating the number of solutions

Factoring the problem

Historical notes

Exercises

7.2.2.1. Dancing links

Exact cover problems

Secondary items

Progress reports

Sudoku

Polyominoes

Polycubes

Factoring an exact cover problem

Color-controlled covering

Introducing multiplicity

*A new dance step

*Analysis of Algorithm X

*Analysis of matching problems

*Maintaining a decent focus

Exploiting local equivalence

*Preprocessing the options

Minimum-cost solutions

*Implementing the min-cost cutoffs

*Dancing with ZDDs

Summary

Historical notes

Exercises—First set

Exercises—Second set

Exercises—Third set

Answers to Exercises

Appendix C—Index to Algorithms and Theorems

Appendix E—Answers to Puzzles in the Answers

Index and Glossary

Breaking News