The Complexity of Boolean Functions

Spis treści:
Introduction to the Theory of Boolean Functions and Circuits.
The Minimimization of Boolean Functions.
The Design of Efficient Circuits for Some Fundamental Functions.
Asymptotic Results and Universal Circuits.
Lower Bounds on Circuit Complexity.
Monotone Circuits.
Relations between Circuit Size, Formula Size and Depth.
Formula Size.
Circuits and other Non–Uniform Computation Methods vs.
Turing Machines and other Uniform Computation Models.
Hierarchies, Mass Production, and Reductions.
Bounded–Depth Circuits.
Synchronous, Planar, and Probabilistic Circuits.
PRAMs and WRAMs: Parallel Random Access Machines.
Branching Programs.
References.
Index.