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 …

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 …

Let K be an infinite field. We give polynomial time constructions of families of r-dimensional
subspaces of K n with the following transversality property: any linear subspace of K n of …

A set A is k (n) membership comparable if there is a polynomial-time computable function
that, given k (n) instances of A of length at most n, excludes one of the 2k (n) possibilities for …

Building on a recent breakthrough by Ogihara, we resolve a conjecture made by Hartmanis
in 1978 regarding the (non) existence of sparse sets complete for P under logspace many …

The main result of this paper is a/spl Omega/(n/sup 1/4/) lower bound on the size of a
sigmoidal circuit computing a specific AC/sub 2//sup 0/function. This is the first lower bound …

J. Hartmanis (1978) conjectured that there exist no sparse complete sets for P under
logspace many-one reductions. In this paper, in support of the conjecture, it is shown that if P …

This book contains a revised version of the dissertation the author wrote at the Department
of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of …

We last had an" open problems" column eighteen months ago [Hem94]. It contained seven
problems. Of the seven, one has since been resolved (at least insofar as one can resolve the …

Building on the recent breakthrough by M. Ogihara (1995), we resolve a conjecture made by
J. Hartmanis (1978) regarding the (non) existence of sparse sets complete for P under …