1. [ACG+03]_G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, M. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Springer-Verlag, second edition, 2003.
2. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 284–293. ACM Press, 1997.
3. L. Adleman. On breaking the iterated Merkle-Hellman public key cryptosystem. In Proceedings of the 15th ACM Symposium on Theory of Computing, pages 402–412. ACM Press, 1983.
4. L. Adleman and M. Huang. Recognizing primes in random polynomial time. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 462–469. ACM Press, May 1987.
5. L. Adleman and M. Huang. Primality Testing and Abelian Varieties over Finite Fields. Springer-Verlag Lecture Notes in Mathematics #1512, Berlin, Heidelberg, New York, 1992.