Abstract is missing.
- Counting Quantifiers, Successor Relations, and Logarithmic SpaceKousha Etessami. 2-11
- Weighted NP Optimization Problems: Logical Definability and Approximation PropertiesMarius Zimand. 12-28
- Semantics versus Syntax versus ComputationsJames S. Royer. 37-48
- On Superlinear Lower Bounds in Complexity TheoryKenneth W. Regan. 50-64
- Decision Trees with AND, OR QueriesYosi Ben-Asher, Ilan Newman. 74-81
- The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an OracleJohn D. Rogers. 90-101
- Inverting the Turing Jump in Complexity TheoryStephen A. Fenner. 102-110
- The Instance Complexity ConjectureMartin Kummer. 111-124
- Frequency Computation and Bounded QueriesRichard Beigel, William I. Gasarch, Efim B. Kinber. 125-132
- Towards Average-Case Complexity Analysis of NP Optimization ProblemsRainer Schuler, Osamu Watanabe. 148-159
- Resource-Bounded GenericityKlaus Ambos-Spies. 162-181
- A Note on Genericity and Bi-ImmunityJosé L. Balcázar, Elvira Mayordomo. 193-196
- An Excursion to the Kolmogorov Random StringsHarry Buhrman, Elvira Mayordomo. 197-203
- Restricted Information from Nonadaptive Queries to NPYenjo Han, Thomas Thierauf. 206-213
- On Approximation Algorithms for Hierarchical MAX-SATSameet Agarwal, Anne Condon. 214-226
- A Game-Theoretic Classification of Interactive Complexity ClassesJoan Feigenbaum, Daphne Koller, Peter W. Shor. 227-237
- Optimizing TRIEs for Ordered Pattern Matching is Pi:::P:::::2::-CompleteChih-Long Lin. 238-244
- On the Structure of Low SetsJohannes Köbler. 246-261
- On P-Immunity of Nondeterministic Complete SetsNicholas Q. Trân. 262-263
- Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse SetsManindra Agrawal, Vikraman Arvind. 264-276
- The Power of Local Self-ReductionsRichard Beigel, Howard Straubing. 277-285
- On Finding the Number of Graph AutomorphismsRichard Chang, William I. Gasarch, Jacobo Torán. 288-298
- On the Power of Number-Theoretic Operations with Respect to CountingUlrich Hertrampf, Heribert Vollmer, Klaus W. Wagner. 299-314
- DSPACE(n)=:::?:::NSPACE(n): A Degree Theoretic CharacterizationManindra Agrawal. 315-323
- A Small Span Theorem for P/Poly-Turing ReductionsJack H. Lutz. 324-330