This is the second volume of a two volume collection on Structural Complexity. This volume
assumes as a prerequisite knowledge about the topics treated in Volume I, but the present …

This book is an accessible introduction to complexity theory and cryptology, two closely
related areas in theoretical computer science. Based on courses taught at Heinrich-Heine …

What is this? Well its a PDF version of the website www. ComplexityZoo. com typeset in
LATEX using the complexity package. Well, what's that? The original Complexity Zoo is a …

Electoral control refers to attempts by an election's organizer (“the chair”) to influence the
outcome by adding/deleting/partitioning voters or candidates. The important paper of …

We show that if a self-reducible set has polynomial-size circuits, then it is low for the
probabilistic class ZPP (NP). As a consequence we get a deeper collapse of the polynomial …

General properties and proof techniques concerning probabilistic complexity classes are
discussed. Two versions of probability amplification lemmas are presented wich connect …

This paper presents resource-bounded category and resource-bounded measure—two new
tools for computational complexity theory—and some applications of these tools to the …

Is there an NP function that, when given a satisfiable formula as input, outputs one satisfying
assignment uniquely? That is, can a nondeterministic function cull just one satisfying …

It is shown that if there is a polynomial-time algorithm that tests k (n)= O (log n) points for
membership in a set A by making only k (n)-1 adaptive queries to an oracle set X, then A …

This paper presents one method of using time-bounded Kolmogorov complexity as a
measure of the complexity of sets, and outlines a number of applications of this approach to …