Mitsunori Ogiwara, Osamu Watanabe On Polynominal Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (Abstract). [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:2- [Conf]

Steven Homer Structural Properties of Nondeterministic Complete Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:3-10 [Conf]

Pekka Orponen On the Instance Complexity of NP-Hard Problems. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:20-27 [Conf]

László Babai E-mail and the Unexpected Power of Interaction. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:30-44 [Conf]

Péter Hajnal On the Power of Randomness in the Decision Tree Model. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:66-77 [Conf]

Richard Chang, Jim Kadin The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:169-178 [Conf]

Noam Nisan On Read-Once vs. Multiple Access to Randomness in Logspace. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:179-184 [Conf]

Peter Clote Bounded Arithmetic and Computational Complexity. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:186-199 [Conf]

James F. Lynch The Quantifier Structure of Sentences that Characterize Nondeterministic Time Complexity. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:210-222 [Conf]

Gerhard Lischke Impossibilities and Possibilities of Weak Separation Between NP and Exponential Time. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:245-253 [Conf]

Jie Wang P-Productivity and Polynominal Time Approximations. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:254-265 [Conf]