The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem Raymond Greenlaw OriginalPaper Pages: 161 - 175
Structural properties for feasibly computable classes of type two Tomoyuki Yamakami OriginalPaper Pages: 177 - 201
Structure and importance of logspace-MOD class Gerhard BuntrockCarsten DammChristoph Meinel OriginalPaper Pages: 223 - 237