SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Mathematische Annalen

Volumn 261, Issue 4, 1982, Pages 515-534

Factoring polynomials with rational coefficients

(3) Lenstra, A K a Lenstra Jr , H W b Lovasz L c

a CWI (Netherlands)

b UNIVERSITY OF AMSTERDAM (Netherlands)

c UNIVERSITY OF SZEGED (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34250244723 PISSN: 00255831 EISSN: 14321807 Source Type: Journal
DOI: 10.1007/BF01457454 Document Type: Article

Times cited : (3204)

References (16)

1
- 84931120575
- 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
- 0003812918
- Mathematical Centre Tracts, 145, Mathematisch Centrum, Amsterdam
- (1981) Multi-dimensional continued fraction algorithms
- Brentjes, A.J.¹

3
- 26844469781
- Irreducible polynomials with integral coefficients have succinct certificates
- (1981) J. Algorithms , vol.2 , pp. 385-392
- Cantor, D.G.¹

4
- 0004258985
- Springer, Berlin, Heidelberg, New York
- (1971) An introduction to the geometry of numbers
- Cassels, J.W.S.¹

5
- 84966244815
- Generalization of the Euclidean algorithm for real numbers to all dimensions higher than two
- (1979) Bulletin of the American Mathematical Society , vol.1 , pp. 912-914
- Ferguson, H.R.P.¹ Forcade, R.W.²

6
- 0003766834
- Oxford University Press, Oxford
- (1979) An introduction to the theory of numbers
- Hardy, G.H.¹ Wright, E.M.²

7
- 0003657590
- Addison-Wesley, Reading
- (1981) The art of computer programming, Vol. 2, Seminumerical algorithms
- Knuth, D.E.¹

8
- 13244282521
- Report IW 190/81, Mathematisch Centrum, Amsterdam
- (1981) Lattices and factorization of polynomials
- Lenstra, A.K.¹

9
- 84931120574
- Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. (to appear)

10
- 84966217433
- An inequality about factors of polynomials
- (1974) Mathematics of Computation , vol.28 , pp. 1153-1157
- Mignotte, M.¹

11
- 0040234050
- A sublinear additive sieve for finding prime numbers
- (1981) Communications of the ACM , vol.24 , pp. 18-23
- Pritchard, P.¹

12
- 84972540003
- Approximate formulas for some functions of prime numbers
- (1962) Ill. J. Math. , vol.6 , pp. 64-94
- Barkley Rosser, J.¹ Schoenfeld, L.²

13
- 84915681524
- MIT, Cambridge
- (1974) The Hensel lemma in algebraic manipulation
- Yun, D.Y.Y.¹

14
- 0000625977
- On Hensel factorization. I.
- (1969) J. Number. Theory , vol.1 , pp. 291-311
- Zassenhaus, H.¹

15
- 84966246617
- A remark on the Hensel factorization method
- (1978) Mathematics of Computation , vol.32 , pp. 287-292
- Zassenhaus, H.¹

16
- 84931120570
- Zassenhaus, H.: A new polynomial factorization algorithm (unpublished manuscript, 1981)

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.