The authors consider the problem of reconstructing (ie, interpolating) at-sparse multivariate
polynomial given a black box which will produce the value of the polynomial for any value of …

It is shown that the time needed by a concurrent-read, concurrent-write parallel random
access machine (CRAM) to check if an input has a certain property is the same as the …

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 …

A major challenge for computer science in the 1990s is to determine the extent to which
general purpose parallel computing can be achieved. The goal is to deliver both scalable …

In this paper we present a fast parallel algorithm for constructing a depth first search tree for
an undirected graph. The algorithm is an RNC algorithm, meaning that it is a probabilistic …

It is shown that the problem of deciding and constructing a perfect matching in bipartite
graphs G with the polynomial permanents of their n× n adjacency matrices A (perm (A)= nO …

We examine various counting measures on space bounded nondeterministic auxiliary
pushdown machines. Hitherto, counting measures on nondeterministic time bounded [Val …

We refine the techniques of Beigel et al.[4] who investigated polynomial-time counting
classes, in order to make them applicable to the case of logarithmic space. We define the …

ALGORITHMS INVENTED IN THE PAST 25 YEARS make it possible on a computer to
efficiently factor a polynomial in one, several, or many variables with coefficients from a …

From the Publisher: Highlights: Motivates theoretical developments by connecting them to
practical issues. Introduces every result and proof with an informal overview to build …