Abstract is missing.
- The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract)Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer. 2
- On Polynomial Time Turing and Many-One Completeness in PSPACEOsamu Watanabe, Shouwen Tang. 15-23
- P-Creative Sets vs. P-Completely Creative SetsJie Wang. 24-33
- Almost Everywhere High Nonuniform ComplexityJack H. Lutz. 37-53
- Boolean Functions, Invariance Groups and Parallel ComplexityPeter Clote. 55-66
- The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier TheoryRichard A. Shore, Theodore A. Slaman. 68-76
- Composition is Almost as Good as S-1-1Yves Marcoux. 77-86
- Finitary Substructure LanguagesKenneth W. Regan. 87-96
- The Power of Parallel Random Access Machines with Augmented Instruction SetsJerry L. Trahan, Michael C. Loui, Vijaya Ramachandran. 97-103
- The Complexity of Iterated MultiplicationNeil Immerman, Susan Landau. 104-111
- The Complexity of Circuit Value and Network StabilityErnst W. Mayr, Ashok Subramanian. 114-123
- Decomposing NC and ACChristopher B. Wilson. 124-131
- On Finding Locally Optimal SolutionsMark W. Krentel. 132-137
- The Complexity Of The Real Line Is A FractalJin-yi Cai, Juris Hartmanis. 138-146
- Results on Communication Complexity ClassesTak Wah Lam, Walter L. Ruzzo. 148-157
- The Generalized Kolmogorov Complexity of SetsEric Allender. 186-194
- On Honest Polynomial Reductions, Relativizations, and P=NPRodney G. Downey, Steven Homer, William I. Gasarch, Michael Moses. 196-207
- Turing Machines with few Accepting Computations and low Sets for PPJohannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán. 208-215
- On the Relativized Power of Additional Accepting PathsRichard Beigel. 216-224
- On the Power of Probabilistic Polynomial Time: P:::NP[log]::: subseteq PPRichard Beigel, Lane A. Hemachandra, Gerd Wechsung. 225-227
- The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract)Leonard Pitt, Manfred K. Warmuth. 230
- The Complexity Types of Computable SetsWolfgang Maass, Theodore A. Slaman. 231-239
- Seperating Complexity Classes Related to Certain Input Oblivious Logarithmic Space-Bounded Turing MachinesMatthias Krause, Christoph Meinel, Stephan Waack. 240-249
- On the Structure of Bounded Queries to Arbitrary NP SetsRichard Chang. 250-258
- Nondeterministic Witnesses and Nonuniform AdviceJosé L. Balcázar. 259-269