Publisher
Springer International Publishing
Reference105 articles.
1. L.M. Adleman, Algorithmic number theory – the complexity contribution, in Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (IEEE, New York, 1994), pp. 88–113
2. L.M. Adleman, J. DeMarrais, M.D.A. Huang, Quantum computability. SIAM J. Comput. 26(5), 1524–1540 (1997)
3. D. Atkins, M. Graff, A.K. Lenstra, P.C. Leyland, The magic words are squeamish ossifrage, in Advances in Cryptology – ASIACRYPT 1994. Lecture Notes in Computer Science, vol. 917 (Springer, Berlin, 1995), pp. 261–277
4. M. Agrawal, N. Kayal, N. Saxena, Primes is in P. Ann. Math. 160(2), 781–793 (2004)
5. C.H. Bennett, E. Bernstein et al., Strengths and weakness of quantum computing. SIAM J. Comput. 26(5), 1510–1523 (1997)