Description
An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.
Read More
This advanced handbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the automata-theoretic approaches, and includes an extensive discussion of the literature to facilitate further research. The coverage includes topics such as the theory of circuit complexity classes, the computational model of Boolean circuits, Turing machines and parallel machines, algebraic complexity, and connections to finite model theory.
Read Less