1-Introduction to the theory of boolean functions and circuits
2-The minimization of boolean functions
3-The design of efficient circuits for some fundamentals functions
4-Asymptotic results and universal circuits
5-Lower bounds on circuits complexity
6-Monotone circuits
7-Relations between circuit size,formula size and depth
8-Formula size
9-Circuits and other non uniform computation methods vs. turing machines and other uniform computation models
10-Hierarchies,mass production and reductions
11-Bounded-depth circuits
12-Synchronous,planar and probabilistic circuits
13-PRAMs and WRAMs:Parallel random access machines
14-Branching programs
