L. Adleman, Two theorems on random polynomial time, in*Proceedings of the 19th IEEE Symposium on Foundations of Computer Science*, IEEE, New York, 1978, 75–83.

L. Babai, Trading group theory for randomness, in*Proceedings of the 17th ACM Symposium on the Theory of Computing*, ACM, New York, 1985, 421–429.

L. Babai and

L. Fortnow, Arithmetization: A new method in structural complexity theory,

*Computational Complexity*,

**1**:1 (1991), 41–66.

Google Scholar
L. Babai, L. Fortnow, and

C. Lund, Non-deterministic exponential time has two-prover interactive protocols,

*Computational Complexity*,

**1**:1 (1991), 3–40.

Google Scholar
L. Babai and

S. Moran, Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes,

*Journal of Computer and System Sciences*,

**36**:2 (1988), 254–276.

Google Scholar
D. Beaver and

J. Feigenbaum, Hiding instances in multioracle queries, in

*Proceedings of the 7th Symposium on Theoretical Aspects of Computer Science*, volume 415 of

*Lecture Notes in Computer Science*, Springer, Berlin, 1990, 37–48.

Google Scholar
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson, Multiprover interactive proofs: How to remove intractability assumptions, in*Proceedings of the 20th ACM Symposium on the Theory of Computing*, ACM, New York, 1988, 113–131.

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** (1981), 96–113.

Google Scholar
M. Blum and S. Kannan, Designing programs that check their work, in*Proceedings of the 21st ACM Symposium on the Theory of Computing*, ACM, New York, 1989, 86–97.

M. Blum, M. Luby, and R. Rubinfeld, Self-testing and self-correcting programs, with applications to numerical programs, in*Proceedings of the 22nd ACM Symposium on the Theory of Computing*, ACM, New York, 1990, 73–83.

M. Blum and

S. Micali, How to generate cryptographically strong sequences of pseudo-random bits,

*SIAM Journal on Computing*,

**13** (1984), 850–864.

Google Scholar
R. Boppana and

R. Hirschfeld, Pseudorandom generators and complexity classes, in

*Randomness and Computation*, volume 5 of

*Advances in Computing Research*, S. Micali, ed., JAI Press, Greenwich, 1989, 1–26.

Google Scholar
O. Goldreich, H. Krawczyk, and M. Luby, On the existence of pseudorandom generators, in*Proceedings of the 29th IEEE Symposium on Foundations of Computer Science*, IEEE, New York, 1988, 12–24.

O. Goldreich and L. Levin, A hard-core predicate for all one-way functions, in*Proceedings of the 21st ACM Symposium on the Theory of Computing*, ACM, New York, 1989, 25–32.

S. Goldwasser, S. Micali, and

C. Rackoff, The knowledge complexity of interactive proof-systems,

*SIAM Journal on Computing*,

**18**:1 (1989), 186–208.

Google Scholar
J. Håstad, Pseudo-random generators under uniform assumptions, in*Proceedings of the 22nd ACM Symposium on the Theory of Computing*, ACM, New York, 1990, 395–404.

J. Hartmanis, N. Immerman, and

V. Sewelson, Sparse sets in

*NP-P: EXPTIME* versus

*NEXPTIME, Information and Control*,

**65** (1985), 158–181.

Google Scholar
H. Heller, On relativized exponential and probabilistic complexity classes,

*Information and Computation*,

**71** (1986), 231–243.

Google Scholar
R. Impagliazzo, L. Levin, and M. Luby, Pseudo-random number generation from one-way functions, in*Proceedings of the 21st ACM Symposium on the Theory of Computing*, ACM, New York, 1989, 12–24.

R. Karp and R. Lipton, Some connections between nonuniform and uniform complexity classes, in*Proceedings of the 12th ACM Symposium on the Theory of Computing*, ACM, New York, 1980, 302–309.

L. Levin, One-way functions and pseudo-random generators,

*Combinatorica*,

**7** (1987), 357–363.

Google Scholar
R. Lipton, New directions in testing, in

*Distributed Computing and Cryptography*, volume 2 of

*DIMACS Series in Discrete Mathematics and Theoretical Computer Science*, J. Feigenbaum and M. Merritt, eds., American Mathematical Society, Providence, 1991, 191–202.

Google Scholar
C. Lund, L. Fortnow, H. Karloff, and

N. Nisan, Algebraic methods for interactive proof systems,

*Journal of the ACM*,

**39**:4 (1992), 859–868.

Google Scholar
N. Nisan and A. Wigderson, Hardness vs. randomness, in*Proceedings of the 29th IEEE Symposium on Foundations of Computer Science*, IEEE, New York, 1988, 2–11.

A. Shamir, IP=PSPACE,

*Journal of the ACM*,

**39**:4 (1992), 869–877.

Google Scholar
A. Yao, Theory and applications of trapdoor functions, in*Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science*, IEEE, New York, 1982, 80–91.