Advertisement

Separability and one-way functions

  • Lance Fortnow
  • John Rogers
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BG81]
    C. Bennet and J. Gill. Relative to a random oracle, P ANP A ≠ co-NP A with probability one. SIAM Journal on Computing, 10:96–113, 1981.CrossRefGoogle Scholar
  2. [BGS75]
    T. Baker, J. Gill, and R. Solovay. Relativizations of the P = NP question. SIAM Journal on Computing, 4(4):431–442, 1975.CrossRefGoogle Scholar
  3. [BI87]
    M. Blum and R. Impagliazzo. Generic oracles and oracle classes. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 118–126. IEEE, New York, 1987.Google Scholar
  4. [CS93]
    P. Crescenzi and R. Silvestri. Sperner's lemma and robust machines. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference, pages 194–199. IEEE, New York, 1993.Google Scholar
  5. [FFK92]
    S. Fenner, L. Fortnow, and S. Kurtz. The isomorphism conjecture holds relative to an oracle. In Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pages 30–39. IEEE, New York, 1992.Google Scholar
  6. [FFKL93]
    S. Fenner, L. Fortnow, S. Kurtz, and L. Li. An oracle builder's toolkit. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference, pages 120–131. IEEE, New York, 1993.Google Scholar
  7. [GG86]
    J. Geske and J. Grollmann. Relativizations of unambiguous and random polynomial time classes. SIAM Journal on Computing, 15(2):511–519, 1986.Google Scholar
  8. [GS88]
    J. Grollmann and A Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17:309–355, 1988.Google Scholar
  9. [HH87]
    J. Hartmanis and L. Hemachandra. One-way functions, robustness and the nonisomorphism of NP-complete sets. In Proceedings of the 2nd IEEE Structure in Complexity Theory Conference, pages 160–173. IEEE, New York, 1987.Google Scholar
  10. [HS92]
    S. Homer and A. Selman. Oracles for structural properties: The isomorphism problem and public-key cryptography. Journal of Computer and System Sciences, 44(2):287–301, 1992.Google Scholar
  11. [IN88]
    R. Impagliazzo and M. Naor. Decision trees and downward closures. In Proceedings of the 3rd IEEE Structure in Complexity Theory Conference, pages 29–38. IEEE, New York, 1988.Google Scholar
  12. [IR89]
    R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In Proceedings of the 21st ACM Symposium on the Theory of Computing, pages 44–61. ACM, New York, 1989.Google Scholar
  13. [KMR89]
    S. Kurtz, S. Mahaney, and J. Royer. The isomorphism conjecture fails to a random oracle. In Proceedings of the 21st ACM Symposium on the Theory of Computing, pages 157–166. ACM, New York, 1989.Google Scholar
  14. [Rac82]
    C. Rackoff. Relativized questions involving probablistic algorithms. Journal of the ACM, 29(1):261–268, 1982.Google Scholar
  15. [Ver93]
    N. Vereshchagin. Relationships between NP-sets, Co-NP-sets and P-sets relative to random oracles. In Proceedings of the 8th IEEE Structure in Complexity Theory Conference, pages 132–138. IEEE, New York, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  1. 1.University of ChicagoUSA

Personalised recommendations