Abstract is missing.
- An Isomorphism Theorem for Circuit ComplexityManindra Agrawal, Eric Allender. 2-11 [doi]
- Nondeterministic NC:::1::: ComputationHervé Caussinus, Pierre McKenzie, Denis Thérien, Heribert Vollmer. 12-21 [doi]
- Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform CircuitsKazuo Iwama, Chuzo Iwamoto. 24-32 [doi]
- Collapsing Oracle-Tape HierarchiesGeorg Gottlob. 33-42 [doi]
- On Coherence, Random-self-reducibility, and Self-correctionJoan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik. 59-67 [doi]
- Error Reduction by Parallel Repetition - a Negative ResultUriel Feige, Oleg Verbitsky. 70-76 [doi]
- VC Dimension in Circuit ComplexityPascal Koiran. 81-85 [doi]
- Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to LDieter van Melkebeek. 88-96 [doi]
- Hierarchies of Circuit Classes that are Closed under ComplementV. Vinay. 108-117 [doi]
- Succinct Representation, Leaf Languages, and Projection ReductionsHelmut Veith. 118-126 [doi]
- Randomization and Derandomization in Space_Bounded ComputationMichael E. Saks. 128-149 [doi]
- On the Measure of Two-Dimensional Regions with Polynomial-Time computables BoundariesKer-I Ko, Klaus Weihrauch. 150-159 [doi]
- On Positive PClemens Lautemann, Thomas Schwentick, Iain A. Stewart. 162-170 [doi]
- A Comparison of Weak Completeness NotionsKlaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng. 171-178 [doi]
- The Law of the Iterated Logarithm for p-Random SequencesYongge Wang. 180-189 [doi]
- Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXPRainer Schuler. 190-195 [doi]
- Much Ado about FunctionsAlan L. Selman. 198-212 [doi]
- Inverting Onto FunctionsStephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers. 213-222 [doi]
- A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NPAshish V. Naik, Alan L. Selman. 224-232 [doi]
- Good Degree Bounds on Nullstellensatz Refutations of the Induction PrincipleSamuel R. Buss, Toniann Pitassi. 233-242 [doi]
- The Complexity of Knowledge RepresentationChristos H. Papadimitriou. 244-248 [doi]
- Integer Programming as a Framework for Optimization and ApproximabilityIan Barland, Phokion G. Kolaitis, Madhukar N. Thakur. 249-259 [doi]
- Complements of Multivalued FunctionsStephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer. 260-269 [doi]
- A Note on Decision versus Search for Graph AutomorphismManindra Agrawal, Vikraman Arvind. 272-277 [doi]
- DNA Models and Algorithms for NP-complete ProblemsEric Bach, Anne Condon, Elton Glaser, Celena Tanguay. 290-300 [doi]