1. Quantum computability;Adleman;SIAM Journal on Computing,1997
2. Recognizing primes in random polynomial time;Adleman,1987
3. σ11 formulea on finite structures;Ajtai;Journal of Pure and Applied Logic,1983
4. Random walks, universal traversal sequences, and the complexity of maze problems;Aleliunas,1979
5. PRIMES is in P;Agrawal,2002