Editorial board
Advertisement
Foreword
A linear lower bound on the unbounded error probabilistic communication complexity
Monotone simulations of non-monotone proofs
Affine projections of symmetric polynomials
On the complexity of approximating the VC dimension
In search of an easy witness: exponential time vs. probabilistic polynomial time
Uniform constant-depth threshold circuits for division and iterated multiplication
Universal traversal sequences with backtracking
Papers to Appear
Volume Author Index
Volume TOC
C3 - Advertisement
C4 - TOC