Jukna. Boolean Function Complexity: Advances and Frontiers
A modern textbook surveying circuit complexity.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Jukna. Extremal Combinatorics web.vu.lt
Combinatorial techniques written largely with an eye to their applications in TCS, and mostly in complexity
-
Clote & Kranakis. Boolean Functions and Computation Models springer.com
An introduction to circuit complexity, boolean functions, and computation models.
-
CNOT cnot.io
Easy to understand, step by step introduction to quantum computing concepts.
-
Moore & Mertens. The Nature of Computation nature-of-computation.org
It spans complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and of quantum computing. It provides accessible explanations
-
Combinatorics and Graph Theory springer.com
-
Arora & Barak. Computational Complexity: A Modern Approach theory.cs.princeton.edu
A golden standard textbook, Surveying computational complexity theory for graduate students and researchers.
Theoretical Computer Science › Computational Complexity > Circuit Complexity > Books: “A modern textbook surveying circuit complexity.”