1. Special issue on circuit complexity: Foreword

   • Pierre McKenzie
   • Denis Thérien

   EditorialNotes Pages: 297 - 300

2. On the degree of boolean functions as real polynomials

   • Noam Nisan
   • Mario Szegedy

   OriginalPaper Pages: 301 - 313

3. When do extra majority gates help? Polylog (N) majority gates are equivalent to one

   • Richard Beigel

   OriginalPaper Pages: 314 - 324

4. Complex polynomials and circuit lower bounds for modular counting

   • David A. Mix Barrington
   • Howard Straubing

   OriginalPaper Pages: 325 - 338

5. Perceptrons, PP, and the polynomial hierarchy

   • Richard Beigel

   OriginalPaper Pages: 339 - 349

6. On ACC

   • Richard Beigel
   • Jun Tarui

   OriginalPaper Pages: 350 - 366

7. Representing Boolean functions as polynomials modulo composite numbers

   • David A. Mix Barrington
   • Richard Beigel
   • Steven Rudich

   OriginalPaper Pages: 367 - 382

8. Circuits constructed with MOD _q gates cannot compute “AND” in sublinear size

   • Denis Thérien

   OriginalPaper Pages: 383 - 388