Abstract is missing.
- Counting Classes Are at Least as Hard as the Polynomial-Time HierarchySeinosuke Toda, Mitsunori Ogiwara. 2-12
- A Complexity Theory for Feasible Closure PropertiesMitsunori Ogiwara, Lane A. Hemachandra. 16-29
- Bounded Queries in Recursion Theory: A SurveyWilliam I. Gasarch. 62-78
- On the Computational Complexity of Small DescriptionsRicard Gavaldà, Osamu Watanabe. 89-101
- Complexity Classes and Sparse OraclesDaniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri. 102-108
- PSPACE Is Provable By Two Provers In One RoundJin-yi Cai, Anne Condon, Richard J. Lipton. 110-115
- One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge ProofsRafail Ostrovsky. 133-138
- On One Query Self-Reducible SetsMitsunori Ogiwara, Antoni Lozano. 139-151
- The Complexity of Malign EnsemblesPeter Bro Miltersen. 164-171
- Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean FunctionsRafi Heiman, Avi Wigderson. 172-179
- On the Monte Carlo Boolean Decision Tree Complexity of Read-Once FormulaeMiklos Santha. 180-187
- A Pseudorandom Oracle Characterization of BPPJack H. Lutz. 190-195
- Notions of Resource-Bounded Category and GenericityStephen A. Fenner. 196-212
- BPP has Subexponential Time Simulation unless EXPTIME has Pubishable ProofsLászló Babai, Noam Nisan. 213-219
- Relating Equivalence and Reducibility to Sparse SetsEric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe. 220-229
- Exponential Time and Subexponential Time SetsShouwen Tang, Bin Fu, Tian Liu. 230-237
- Adaptive Logspace and Depth-Bounded ReducibilitiesJosé L. Balcázar. 240-254
- Connections between the Complexity of Unique Satisfiability and the Threshold Behavior of Randomized ReductionsRichard Chang, Jim Kadin, Pankaj Rohatgi. 255-269
- Counting Auxiliary Pushdown AutomataV. Vinay. 270-284
- The Perceptron Strikes BackRichard Beigel, Nick Reingold, Daniel A. Spielman. 286-291
- Monotone Separation of Logspace from NCMichelangelo Grigni, Michael Sipser. 294-298
- Super-logarithmic Depth Lower Bounds via Direct Sum in Communication CoplexityMauricio Karchmer, Ran Raz, Avi Wigderson. 299-304
- Superlinear Lower Bounds for Bounded-Width Branching ProgramsDavid A. Mix Barrington, Howard Straubing. 305-313
- Geometric Arguments Yield Better Bounds for Threshold Circuits and Distributed ComputingMatthias Krause. 314-321
- Lower Bounds with Smaller Domain Size On Concurrent Write Parallel MachinesJeff Edmonds. 322-331
- Capturing Complexity Classes by Fragments of Second Order LogicErich Grädel. 341-352
- Approximation Properties of NP Minimization ClassesPhokion G. Kolaitis, Madhukar N. Thakur. 353-366
- Approximation and Small Depth Frege ProofsStephen Bellantoni, Toniann Pitassi, Alasdair Urquhart. 367-390
- Degree Compexity of Boolean Functions and Its Applications to Realivized SeparationsJun Tarui. 382-390
- Errata for Circuit Size to Pseudorandom OraclesJack H. Lutz, William J. Schmidt. 392