GUEST EDITOR'S FOREWORD
Computational Arithmetic Geometry: I. Sentences Nearly in the Polynomial Hierarchy
Pseudorandom Generators without the XOR Lemma
Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes
Graph Ramsey Theory and the Polynomial Hierarchy
The Communication Complexity of Pointer Chasing
A Lower Bound for Primality
On the Complexity of k-SAT
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity
Papers to Appear in Forthcoming Issues