3 docs tagged with "discrete-mathematics"

Define the objects being counted, then use bijections, double counting, inclusion–exclusion, and pigeonhole arguments to solve finite problems and bound search and output costs.

A foundation map for logic, proof, counting, discrete structures, and probability in computer science.

How existence proofs, explicit constructions, and practical execution differ in finite games, with the limits of strategy stealing and game-tree pruning.