Abstract is missing.
- Six Hypotheses in Search of a TheoremHarry Buhrman, Lance Fortnow, Leen Torenvliet. 2-12 [doi]
- Circuits Over PP and PLRichard Beigel, Bin Fu. 24-35 [doi]
- The General Notion of a Dot-OperatorBernd Borchert, Riccardo Silvestri. 36-44 [doi]
- Reversible Space Equals Deterministic SpaceKlaus-Jörn Lange, Pierre McKenzie, Alain Tapp. 45-50 [doi]
- Nondeterministic Polynomial Time versus Nondeterministic Logarithmic Space: Time-Space Tradeoffs for SatisfiabilityLance Fortnow. 52-60 [doi]
- Polynomial Vicinity Circuits and Nonlinear Lower BoundsKenneth W. Regan. 61-68 [doi]
- A Note on Universal Distributions for Polynomial-Time Computable DistributionsRainer Schuler. 69-73 [doi]
- LR(k) Testing is Average Case CompleteChristoph Karg. 74-80 [doi]
- Complexity and Expressive Power of Logic ProgrammingEvgeny Dantsin, Thomas Eiter, Georg Gottlob, Andrei Voronkov. 82-101 [doi]
- Hyper-Polynomial Hierarchies and the NP-JumpStephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer. 102-110 [doi]
- The Density of Weakly Complete Problems under Adaptive ReductionsJack H. Lutz, Yong Zhao. 111-120 [doi]
- Separating NP-Completeness Notions under Strong HypothesesKlaus Ambos-Spies, Levke Bentzien. 121-127 [doi]
- Undecidability Results for Low Complexity Degree StructuresRodney G. Downey, André Nies. 128-132 [doi]
- On TC:::0:::, AC:::0:::, and Arithmetic CircuitsManindra Agrawal, Eric Allender, Samir Datta. 134-148 [doi]
- Upper and Lower Bounds for Some Depth-3 Circuit ClassesRichard Beigel, Alexis Maciel. 149-157 [doi]
- Circuit Bottom Fan-in and Computational PowerLiming Cai, Jianer Chen, Johan Håstad. 158-164 [doi]
- A Lower Bound for Perceptrons and an Oracle Separation of the PP:::PH::: HierarchyChrister Berg, Staffan Ulfberg. 165-172 [doi]
- On Operators of Higher TypesHeribert Vollmer, Klaus W. Wagner. 174-184 [doi]
- Time Bounded Frequency ComputationsMaren Hinrichs, Gerd Wechsung. 185-192 [doi]
- Circuits and Expressions with NOn-Associative GatesJoshua Berman, Arthur Drisko, François Lemieux, Cristopher Moore, Denis Thérien. 193-203 [doi]
- A Nonadaptive NC Checker for Permutation Group IntersectionVikraman Arvind, Jacobo Torán. 204-212 [doi]
- Acceptance by Transformation Monoids (with an Application to Local Self Reductions)Ulrich Hertrampf. 213-224 [doi]
- The Communication Complexity of the Universal RelationGábor Tardos, Uri Zwick. 247-259 [doi]
- A Short Guide to Approximation Preserving ReductionsPierluigi Crescenzi. 262-273 [doi]
- Tight Bound on Johnson s Algoritihm for Max-SATJianer Chen, Donald K. Friesen, Hao Zheng. 274-281 [doi]
- Constraint Satisfaction: The Approximability of Minimization ProblemsSanjeev Khanna, Madhu Sudan, Luca Trevisan. 282-296 [doi]
- A Note on the Bottleneck Counting ArgumentJanos Simon, Shi-Chun Tsai. 297-301 [doi]