Richard Beigel Perceptrons, PP, and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:14-19 [Conf]

Thomas Hofmeister The Power of Negative Thinking in Constructing Threshold Circuits for Addition. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:20-26 [Conf]

Lide Li Formal Power Series: An Algebraic Approach to the GapP and #P Functions. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:144-154 [Conf]

Steven Lindell A Purely Logical Characterization of Circuit Uniformity. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:185-192 [Conf]

Stephen A. Bloch Functional Characterizations of Uniform Log-depth and Polylog-depth Circuit Families. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:193-206 [Conf]

Bin Fu, Hong-Zhou Li On Closeness of NP-Hard Sets to Other Complexity Classes. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:243-248 [Conf]

Ricard Gavaldà Bounding the Complexity of Advice Functions. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:249-254 [Conf]

Farrokh Vatan Some Lower and Upper Bounds for Algebraic Decision Trees and the Separation Problem. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:295-304 [Conf]

Ker-I Ko A Note on the Instance Complexity of Pseudorandom Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1992, pp:327-337 [Conf]