Steven Homer, Alan L. Selman Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:3-14 [Conf]

Jie Wang P-Creative Sets vs. P-Completely Creative Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:24-33 [Conf]

Jack H. Lutz Almost Everywhere High Nonuniform Complexity. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:37-53 [Conf]

Noam Nisan Hardness vs. Randomness - A Survey (abstract). [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:54- [Conf]

Peter Clote Boolean Functions, Invariance Groups and Parallel Complexity. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:55-66 [Conf]

Richard A. Shore, Theodore A. Slaman The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:68-76 [Conf]

Yves Marcoux Composition is Almost as Good as S-1-1. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:77-86 [Conf]

Uriel Feige, Adi Shamir Multi-Oracle Interactive Protocols with Space Bounded Verifiers. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:158-164 [Conf]

Eric Allender The Generalized Kolmogorov Complexity of Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:186-194 [Conf]

Richard Beigel On the Relativized Power of Additional Accepting Paths. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:216-224 [Conf]

Leonard Pitt, Manfred K. Warmuth The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial (abstract). [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:230- [Conf]

Richard Chang On the Structure of Bounded Queries to Arbitrary NP Sets. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:250-258 [Conf]

José L. Balcázar Nondeterministic Witnesses and Nonuniform Advice. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:259-269 [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