Eric Allender The Complexity of Sparse Sets in P. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:1-11 [Conf]

Eric Allender Isomorphisms and 1-L Reductions. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:12-22 [Conf]

Klaus Ambos-Spies Randomness, Relativizations, and Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:23-34 [Conf]

Samuel R. Buss The Polynomial Hierarchy and Intuitionistic Bounded Arithmetic. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:77-103 [Conf]

Jin-yi Cai With Probability One, A Random Oracle Separates PSPACE from the Polynomial- Time Hierarchy. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:104-104 [Conf]

Dung T. Huynh Resource- Bounded Kolmogorov Complexity of Hard Languages. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:184-195 [Conf]

Mark W. Krentel The Complexity of Optimization Problems. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:217-217 [Conf]

James F. Lynch A Depth- Size Tradeoff for Boolean Circuits with Unbounded Fan- In. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:234-248 [Conf]

Wolfgang Maass, Georg Schnitger An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:249-264 [Conf]

Ken McAloon Separation Results for Bounded Alternation. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:265-271 [Conf]

Kenneth W. Regan The Topology of Provability in Complexity Theory. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:291-310 [Conf]

David A. Russo Optimal Approximations of Complete Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:311-324 [Conf]

Michael Sipser Expanders, Randomness, or Time versus Space. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:325-329 [Conf]

Carol Tretkoff Bounded Oracles and Complexity Classes Inside Linear Space. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:347-361 [Conf]

Christopher B. Wilson Parallel Computation and the NC Hierarchy Relativized. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:362-382 [Conf]

Stathis Zachos Probabilistic Quantifiers, Adversaries, and Complexity Classes: An Overview. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1986, pp:383-400 [Conf]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP