1. An editorial

   • Joachim von zur Gathen

   EditorialNotes Pages: 1 - 2

2. Non-deterministic exponential time has two-prover interactive protocols

   • László Babai
   • Lance Fortnow
   • Carsten Lund

   OriginalPaper Pages: 3 - 40

3. Arithmetization: A new method in structural complexity theory

   • László Babai
   • Lance Fortnow

   OriginalPaper Pages: 41 - 66

4. On the decidability of sparse univariate polynomial interpolation

   • Allan Borodin
   • Prasoon Tiwari

   OriginalPaper Pages: 67 - 90

5. Towards optimal simulations of formulas by bounded-width programs

   • Richard Cleve

   OriginalPaper Pages: 91 - 105

6. Instructions for preparing camera-ready manuscripts

   Announcement Pages: 106 - 111