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 …

We determine the exact power of two-prover interactive proof systems introduced by Ben-Or,
Goldwasser, Kilian, and Wigderson (1988). In this system, two all-powerful …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

The class ACC consists of circuit families with constant depth over unbounded fan-in AND,
OR, NOT, and MODm gates, where m> 1 is an arbitrary constant. We prove the following …

Publisher Summary This chapter discusses the concepts needed for defining the complexity
classes. A complexity class is a set of problems of related resource-based complexity. A …

When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

The P vs NP problem arose from the question of whether exhaustive search is necessary for
problems with short verifiable solutions. We still do not know if even a slight algorithmic …

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 …

The time separation results concerning classes of languages over a single-letter alphabet
accepted by multi-tape nondeterministic Turing machines, well-known from Seiferas, Fischer …

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