This book investigates the fundamental distinction between explicit and implicit algorithmic descriptions of mathematical objects and their implications for complexity theory. Authors Alessandra Carbone and Stephen Semmes utilize their expertise in geometry and logic to construct a new formal language for analyzing combinatorial problems. By examining objects ranging from graphs to formal proofs, the authors argue that a geometric approach provides a more robust framework for understanding complexity classes such as P, NP, and co-NP.

Experts recognize this monograph as a specialized contribution to the intersection of geometry and theoretical computer science. Readers frequently note the high level of technical density, making it a resource primarily intended for researchers and advanced graduate students in mathematics.