Author:
Lenstra A. K.,Lenstra H. W.,Lovász L.
Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Adleman, L.M., Odlyzko, A.M.: Irreducibility testing and factorization of polynomials, to appear. Extended abstract: Proc. 22nd Annual IEEE Symp. Found. Comp. Sci., pp. 409–418 (1981)
2. Mathematical Centre Tracts;A.J. Brentjes,1981
3. Cantor, D.G.: Irreducible polynomials with integral coefficients have succinct certificates. J. Algorithms2, 385–392 (1981)
4. Cassels, J.W.S.: An introduction to the geometry of numbers. Berlin, Heidelberg, New York: Springer 1971
5. Ferguson, H.R.P., Forcade, R.W.: Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two. Bull. Am. Math. Soc.1, 912–914 (1979)
Cited by
2542 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献