A program correctness checker is an algorithm for checking the output of a computation.
That is, given a program and an instance on which the program is run, the checker certifies …

The paper considers two decision problems on hypergraphs, hypergraph saturation and
recognition of the transversal hypergraph, and discusses their significance for several …

For a monoid G, the iterated multiplication problem is the computation of the product of n
elements from G. By refining known completeness arguments, we show that as G varies over …

A well known result of proof theory is the characterization of primitive recursive functions ƒ
as those provably recursive in the first order theory of Peano arithmetic with the induction …

Viewing a parallel execution as a set of tasks that execute on a set of processors, a main
problem is to find a schedule of the tasks that provides an efficient execution. This usually …

Algorithm design paradigms are particularly useful for designing new and efficient
algorithms. However, several sequential algorithm design paradigms seem to fail in the …

This paper furthers the study of quasilinear-time complexity initiated by Schnorr and
Gurevich and Shelah. We show that the fundamental properties of the polynomial-time …

We consider the complexity of various computational problems over nonassociative
algebraic structures. Specifically, we look at the problem of evaluating circuits, formulas, and …

In this paper, we study the complexity of deciding readiness and failure equivalences for
finite state processes and recursively defined processes specified by normed context-free …

Some structural relationships between matchings and independent sets are presented. One
consequence is that any NC algorithm for generating a uniform random perfect matching of …