Kazuo Iwama, Chuzo Iwamoto Parallel Complexity Hierarchies Based on PRAMs and DLOGTIME-Uniform Circuits. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:24-32 [Conf]

Georg Gottlob Collapsing Oracle-Tape Hierarchies. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:33-42 [Conf]

Noam Nisan Extracting Randomness: How and Why A survey. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:44-58 [Conf]

Marcus Schäfer Deciding the Vapnik-Cervonenkis dimension is Sigma^{P}_{3}-complete. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:77-80 [Conf]

Pascal Koiran VC Dimension in Circuit Complexity. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:81-85 [Conf]

Dieter van Melkebeek Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:88-96 [Conf]

V. Vinay Hierarchies of Circuit Classes that are Closed under Complement. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:108-117 [Conf]

Helmut Veith Succinct Representation, Leaf Languages, and Projection Reductions. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:118-126 [Conf]

Michael E. Saks Randomization and Derandomization in Space_Bounded Computation. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:128-149 [Conf]

Ker-I Ko, Klaus Weihrauch On the Measure of Two-Dimensional Regions with Polynomial-Time computables Boundaries. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:150-159 [Conf]

Yongge Wang The Law of the Iterated Logarithm for p-Random Sequences. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:180-189 [Conf]

Rainer Schuler Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:190-195 [Conf]

Ashish V. Naik, Alan L. Selman A Note on P-selective sets and on Adaptive versus Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:224-232 [Conf]

Samuel R. Buss, Toniann Pitassi Good Degree Bounds on Nullstellensatz Refutations of the Induction Principle. [Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:233-242 [Conf]