215 | -- | 0 | Lance Fortnow. Guest Editor s Foreword |
216 | -- | 235 | J. Maurice Rojas. Computational Arithmetic Geometry I. Sentences Nearly in the Polynomial Hierarchy |
236 | -- | 266 | Madhu Sudan, Luca Trevisan, Salil P. Vadhan. Pseudorandom Generators without the XOR Lemma |
267 | -- | 289 | Samuel R. Buss, Dima Grigoriev, Russell Impagliazzo, Toniann Pitassi. Linear Gaps between Degrees for the Polynomial Calculus Modulo Distinct Primes |
290 | -- | 322 | Marcus Schaefer. Graph Ramsey Theory and the Polynomial Hierarchy |
323 | -- | 355 | Stephen Ponzio, Jaikumar Radhakrishnan, Srinivasan Venkatesh. The Communication Complexity of Pointer Chasing |
356 | -- | 366 | Eric Allender, Michael E. Saks, Igor Shparlinski. A Lower Bound for Primality |
367 | -- | 375 | Russell Impagliazzo, Ramamohan Paturi. On the Complexity of k-SAT |
376 | -- | 391 | John Watrous. Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity |