1. Majority gates vs. general weighted threshold gates

   • Mikael Goldmann
   • Johan Håstad
   • Alexander Razborov

   OriginalPaper Pages: 277 - 300

2. Graph isomorphism is low for PP

   • Johannes Köbler
   • Uwe Schöning
   • Jacobo Torán

   OriginalPaper Pages: 301 - 330

3. Cartesian graph factorization at logarithmic cost per edge

   • F. Aurenhammer
   • J. Hagauer
   • W. Imrich

   OriginalPaper Pages: 331 - 349

4. Randomized range-maxima in nearly-constant parallel time

   • Omer Berkman
   • Yossi Matias
   • Uzi Vishkin

   OriginalPaper Pages: 350 - 373

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

   • L. Babai
   • L. Fortnow
   • C. Lund

   Addendum Pages: 374 - 374