Jay Belanger, Jie Wang Isomorphisms of NP Complete Problems on Random Instances. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:65-74 [Conf]

Richard Beigel The Polynomial Method in Circuit Complexity. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:82-95 [Conf]

Shi-Chun Tsai Lower Bounds on Representing Boolean Functions as Polynomials in Z_{m}. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:96-101 [Conf]

Nikolai K. Vereshchagin Relationships between NP-sets, Co-NP-sets, and P-sets relative to random oracles. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:132-138 [Conf]

Jack H. Lutz The Quantitative Structure of Exponential Time. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:158-175 [Conf]

Bin Fu With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:185-191 [Conf]

Sanjeev Saluja Relativized limitations of left set technique and closure classes of sparse sets (Extended Abstract). [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:215-222 [Conf]

Klaus-Jörn Lange Complexity and Structure in Formal Language Theory. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:224-238 [Conf]

Sanjay Gupta Alternating Time Versus Deterministic Time: A Separation. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:266-277 [Conf]

Tirza Hirst, David Harel Taking it to the Limit: On Infinite Variants of NP-Complete Problems. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:292-304 [Conf]

David Zuckerman NP-Complete Problems Have a Version That's Hard to Approximate. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1993, pp:305-312 [Conf]