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.
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
Nowadays constraint satisfaction problems (CSPs) are ubiquitous in many different areas of computer science, from artificial intelligence and database systems to circuit design, network optimization,
