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 …

We examine the computational complexity of testing and finding small plans in probabilistic
planning domains with both flat and propositional representations. The complexity of plan …

Controlled stochastic systems occur in science engineering, manufacturing, social sciences,
and many other cntexts. If the systems is modeled as a Markov decision process (MDP) and …

Finite automata are probably best known for being equivalent to right-linear context-free
grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of …

SPARQL-the standard query language for querying RDF-provides only limited navigational
functionalities, although these features are of fundamental importance for graph data formats …

We show that the graph isomorphism problem is hard under DLOGTIME uniform AC ^0
many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for …

We prove a new combinatorial characterization of the determinant. The characterization
yields a simple combinatorial algorithm for computing the determinant. Hitherto, all (known) …

We show that in the context of nonuniform complexity, nondeterministic logarithmic space
bounded computation can be made unambiguous. An analogous result holds for the class of …

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 …

Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the
determinant is characterized by the complexity ofeounting the number ofaccepting …