1. ADLEMAN, L., Two theorems on random polynomial time, in: Proc. 19th Ann. IEEE Symp on Foundations of Computer Science (1978) 75–83.
2. ADLEMAN, L. and M. HUANG, Recognizing primes in random polynomial time, in: Proc. 19th Ann. ACM Symp. on Theory of Computing (1987) 462–470.
3. ADLEMAN, L. and K. MANDERS, Reducibility, randomness, and intractability, in: Proc. 9th Ann. ACM Symp. on Theory of Computing (1977) 151–163.
4. ADLEMAN, L. M. and K. MANDERS, Reductions that lie, in: Proc. 20th Ann. IEEE Symp. on Foundations of Computer Science (1979) 397–410.
5. The Design and Analysis of Computer Algorithms;AHO,1974