Abstract is missing.
- Majority Gates vs. General Weighted Threshold GatesMikael Goldmann, Johan Håstad, Alexander A. Razborov. 2-13
- Perceptrons, PP, and the Polynomial HierarchyRichard Beigel. 14-19
- The Power of Negative Thinking in Constructing Threshold Circuits for AdditionThomas Hofmeister. 20-26
- A Sublinear Space, Polynomial Time Algorithm for Directed s-t ConnectivityGreg Barnes, Jonathan F. Buss, Walter L. Ruzzo, Baruch Schieber. 27-33
- Fixed-Parameter IntractabilityRodney G. Downey, Michael R. Fellows. 36-49
- Some Properties of Exponential Time Complexity ClassesBin Fu, Hong-Zhou Li, Yong Zhong. 50-57
- Saving Queries with RandomnessPankaj Rohatgi. 71-83
- Quasipolynomial Size Circuit ClassesDavid A. Mix Barrington. 86-93
- Cicuits, Matrices, and Nonassociative ComputationMartin Beaudry, Pierre McKenzie. 94-106
- The Power of the Middle BitFrederic Green, Johannes Köbler, Jacobo Torán. 111-117
- On the Nonuniform Complexity on the Graph Isomorphism ProblemAntoni Lozano, Jacobo Torán. 118-129
- On The Power of PPNikolai K. Vereshchagin. 138-143
- Formal Power Series: An Algebraic Approach to the GapP and #P FunctionsLide Li. 144-154
- Fixpoint Logics, Relational Machines, and Computational ComplexitySerge Abiteboul, Moshe Y. Vardi, Victor Vianu. 156-168
- Descriptive Complexity of #P FunctionsSanjeev Saluja, K. V. Subrahmanyam, Madhukar N. Thakur. 169-184
- A Purely Logical Characterization of Circuit UniformitySteven Lindell. 185-192
- Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit FamiliesStephen A. Bloch. 193-206
- Universal RelationsManindra Agrawal, Somenath Biswas. 207-220
- How Hard Are Sparse Sets?Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe. 222-238
- On Randomized Reductions to Sparse SetsDesh Ranjan, Pankaj Rohatgi. 239-242
- On Closeness of NP-Hard Sets to Other Complexity ClassesBin Fu, Hong-Zhou Li. 243-248
- Bounding the Complexity of Advice FunctionsRicard Gavaldà. 249-254
- On Languages with Very High Information ContentRonald V. Book, Jack H. Lutz. 255-259
- Fractional Covers and Communication ComplexityMauricio Karchmer, Eyal Kushilevitz, Noam Nisan. 262-274
- Non-deterministic Communication Complexity with Few WitnessMauricio Karchmer, Ilan Newman, Michael E. Saks, Avi Wigderson. 275-281
- Interactive Proof Systems with Polynomially Bounded StrategiesAnne Condon, Richard E. Ladner. 282-294
- Some Lower and Upper Bounds for Algebraic Decision Trees and the Separation ProblemFarrokh Vatan. 295-304
- Average Dependence and Random OraclesStuart A. Kurtz, Stephen R. Mahaney, James S. Royer. 306-317
- On Average P vs. Average NPJie Wang, Jay Belanger. 318-326
- A Note on the Instance Complexity of Pseudorandom SetsKer-I Ko. 327-337
- The Power of Adaptiveness and Additional Queries in Random-Self-ReductionsJoan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman. 338-346