fasc.0. Introduction to combinatorial algorithms and boolean functions

This fascicle introduces a chapter on combinatorial algorithms. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs. This fascicle discussing first the ideas of combinatorics and then introducing ideas for dealing efficiently with 0s and 1s inside a machine, including Boolean basics and Boolean function evaluation.