This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

One of the more significant achievements of twentieth century mathematics, especially from
the viewpoints of logic and computer science, was the work of Church, Gödel and Turing in …

The equivalence problem for Kleene's regular expressions has several effective solutions,
all of which are computationally inefficient. In [1], we showed that this inefficiency is an …

This is a book about graph homomorphisms. Graph theory is now an established discipline
but the study of graph homomorphisms has only recently begun to gain wide acceptance …

A complete treatment of fundamentals and recent advances in complexity theory Complexity
theory studies the inherent difficulties of solving algorithmic problems by digital computers …

We analyze the computational complexity of determining whether F is satisfiable when F is a
formula of the classical predicate calculus obeying certain syntactic restrictions. For …

Abstract In 1950, John Nash sent a remarkable letter to the National Security Agency, in
which—seeking to build theoretical foundations for cryptography—he all but formulated what …

Invitation Invitation Secret Secret 1 1 Algorithms Algorithms are are at at the the heart heart
of of complexity complexity theory. theory. That That is is the the dark dark secret secret of of …

This revised and extensively expanded edition of Computability and Complexity Theory
comprises essential materials that are core knowledge in the theory of computation. The …

Techniques such as those of Meyer and Stockmeyer [21], Meyer [19], Stockmeyer and Meyer
[29], Hunt [14], MJ Fischer and Rabin [8], and Stockmeyer [28] sometimes show that a …