1. The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem

   • Raymond Greenlaw

   OriginalPaper Pages: 161 - 175

2. Structural properties for feasibly computable classes of type two

   • Tomoyuki Yamakami

   OriginalPaper Pages: 177 - 201

3. A survey of one-way functions in complexity theory

   • Alan L. Selman

   OriginalPaper Pages: 203 - 221

4. Structure and importance of logspace-MOD class

   • Gerhard Buntrock
   • Carsten Damm
   • Christoph Meinel

   OriginalPaper Pages: 223 - 237