1. The complexity of matrix rank and feasible systems of linear equations

   • E. Allender
   • R. Beals
   • M. Ogihara

   Pages: 99 - 126

2. Lower bounds for the polynomial calculus and the Gröbner basis algorithm

   • R. Impagliazzo
   • P. Pudlák
   • J. Sgall

   Pages: 127 - 144

3. Randomness complexity of private computation

   • C. Blundo
   • A. De Santis
   • U. Vaccaro

   Pages: 145 - 168

4. Adaptive versus nonadaptive queries to NP and p-selective sets

   • A.V. Naik
   • A.L. Selman

   Pages: 169 - 187

5. Feasibly continuous type-two functionals

   • B.M. Kapron

   Pages: 188 - 201