James S. Royer Semantics versus Syntax versus Computations. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:37-48 [Conf]

Kenneth W. Regan On Superlinear Lower Bounds in Complexity Theory. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:50-64 [Conf]

Anna Gál, Mario Szegedy Fault Tolerant Circuits and Probabilistically Checkable Proofs. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:65-73 [Conf]

Anna Gál Semi-Unbounded Fan-In Circuits: Boolean vs. Arithmetic. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:82-87 [Conf]

John D. Rogers The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an Oracle. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:90-101 [Conf]

Stephen A. Fenner Inverting the Turing Jump in Complexity Theory. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:102-110 [Conf]

Martin Kummer The Instance Complexity Conjecture. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:111-124 [Conf]

Stephen A. Fenner Resource-Bounded Baire Category: A Stronger Approach. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:182-192 [Conf]

Chih-Long Lin Optimizing TRIEs for Ordered Pattern Matching is Pi^{P}_{2}-Complete. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:238-244 [Conf]

Nicholas Q. Trân On P-Immunity of Nondeterministic Complete Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:262-263 [Conf]

Manindra Agrawal, Vikraman Arvind Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:264-276 [Conf]

Manindra Agrawal DSPACE(n)=^{?}NSPACE(n): A Degree Theoretic Characterization. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:315-323 [Conf]

Jack H. Lutz A Small Span Theorem for P/Poly-Turing Reductions. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:324-330 [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