Journal of the ACM Bibliography

Selected papers that cite this one

• P. Cintioli and R. Silvestri. Helping by unambiguous computation and probabilistic computation. Theory of Computing Systems, 30(2):165-180, March/April 1997.

• Stephen Cook, Russell Impagliazzo, and Tomoyuki Yamakami. A tight relationship between generic oracles and type-2 complexity theory. Information and Computation, 137(2):159-170, 15 September 1997.

• Shimon Even, Alan L. Selman, and Yacov Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control, 61(2):159-173, May 1984.

• Stephen Fenner, Lance Fortnow, and Stuart A. Kurtz. The isomorphism conjecture holds relative to an oracle. SIAM Journal on Computing, 25(1):193-206, February 1996.

• Lance Fortnow and Tomoyuki Yamakami. Generic separations. Journal of Computer and System Sciences, 52(1):191-197, February 1996.

• W. Ian Gasarch and Steven Homer. Relativizations comparing NP and exponential time. Information and Control, 58(1-3):88-100, July/August/September 1983.

• Marek Karpinski and Rutger Verbeek. On randomized versus deterministic computation. Theoretical Computer Science, 154(1):23-39, 22 January 1996.

• Stuart A. Kurtz, Stephen R. Mahaney, and James S. Royer. The isomorphism conjecture fails relative to a random oracle. Journal of the ACM, 42(2):401-420, March 1995.

• Andrei A. Muchnik and Nikolai K. Vereshchagin. A general method to construct oracles realizing given relationships between complexity classes. Theoretical Computer Science, 157(2):227-258, 5 May 1996.

• John Rogers. The Isomorphism Conjecture holds and one-way functions exist relative to an oracle. Journal of Computer and System Sciences, 54(3):412-423, June 1997.

• Stathis Zachos. Robustness of probabilistic computational complexity classes under definitional perturbations. Information and Control, 54(3):143-154, September 1982.

Shortcuts: