Clote & Kranakis. Boolean Functions and Computation Models
An introduction to circuit complexity, boolean functions, and computation models.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Jukna. Boolean Function Complexity: Advances and Frontiers springer.com
A modern textbook surveying circuit complexity.
-
Krantz. Handbook of Logic and Proof Techniques for Computer Science maa.org
A concise offered as an accessible reference on mathematical logic for the professional computer scientist.
-
Modeling and Proving in Computational Type Theory github.com
Book covering topics in computational logic using Coq, including foundations, canonical case studies, and practical programming.
-
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
-
Sipser. Introduction to Theory of Computation cengage.com
A standard text for introducing theory of computation for undergrads.
-
Eck & Critchlow. Foundations of Computation math.hws.edu
for a one-semester course in theoretical computer science. It has no prerequisites other than introductory computer programming. It includes logic, sets, and function from discrete math, and automata, formal languages, and grammar from upper-level courses.
Theoretical Computer Science › Computational Complexity > Circuit Complexity > Books: “An introduction to circuit complexity, boolean functions, and computation models.”