The full paper is available from the authors.
partially supported by NSF grant CCR 92-53582
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Bennet and J. Gill. Relative to a random oracle, P A ≠ NP A ≠ co-NP A with probability one. SIAM Journal on Computing, 10:96–113, 1981.
T. Baker, J. Gill, and R. Solovay. Relativizations of the P = NP question. SIAM Journal on Computing, 4(4):431–442, 1975.
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.
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.
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.
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.
J. Geske and J. Grollmann. Relativizations of unambiguous and random polynomial time classes. SIAM Journal on Computing, 15(2):511–519, 1986.
J. Grollmann and A Selman. Complexity measures for public-key cryptosystems. SIAM Journal on Computing, 17:309–355, 1988.
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.
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.
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.
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.
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.
C. Rackoff. Relativized questions involving probablistic algorithms. Journal of the ACM, 29(1):261–268, 1982.
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.
Author information
Authors and Affiliations
Corresponding authors
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fortnow, L., Rogers, J. (1994). Separability and one-way functions. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_204
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_204
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive