메뉴 건너뛰기
Mathematics of Computation
Volumn 71, Issue 240, 2002, Pages 1663-1676
Hensel lifting and bivariate polynomial factorisation over finite fields
Author keywords

Average case complexity; Bivariate polynomial; Factorisation; Finite field; Hensel lifting
Indexed keywords

EID: 0036792341     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-01-01393-X     Document Type: Article
Times cited : (19)
References (16)
  • 1
    • 0015143623 scopus 로고
    • On Euclid's algorithm and the computation of polynomial greatest common divisors
    • MR 46:6570
    • W.S. Brown, "On Euclid's algorithm and the computation of polynomial greatest common divisors", J. ACM 18 (1971), 478-504. MR 46:6570.
    • (1971) J. ACM , vol.18 , pp. 478-504
    • Brown, W.S.1
  • 2
    • 34249916280 scopus 로고
    • On fast multiplication of polynomials over arbitrary algebras
    • MR 92i:68068
    • D.G. Cantor and E. Kaltofen, "On fast multiplication of polynomials over arbitrary algebras", Acta Inform. 28 (1991), 693-701. MR 92i:68068.
    • (1991) Acta Inform. , vol.28 , pp. 693-701
    • Cantor, D.G.1    Kaltofen, E.2
  • 3
    • 0002792209 scopus 로고
    • The arithmetic of polynomials in a Galois field
    • L. Carlitz, "The arithmetic of polynomials in a Galois field", Amer. J. Math. 54 (1932), 39-50.
    • (1932) Amer. J. Math. , vol.54 , pp. 39-50
    • Carlitz, L.1
  • 4
    • 0010659661 scopus 로고
    • Factoring univariate integral polynomials in polynomial average time
    • Symbolic and algebraic computation (EUROSAM '79, Internat. Sympos., Marseille, 1979), Springer, Berlin-New York. MR 81g:68064
    • G.E. Collins, "Factoring univariate integral polynomials in polynomial average time", Symbolic and algebraic computation (EUROSAM '79, Internat. Sympos., Marseille, 1979), pp. 317-329, Lecture Notes in Comput. Sci., 72, Springer, Berlin-New York, 1979. MR 81g:68064.
    • (1979) Lecture Notes in Comput. Sci. , vol.72 , pp. 317-329
    • Collins, G.E.1
  • 5
    • 84947786774 scopus 로고    scopus 로고
    • Random polynomials and polynomial factorization
    • Automata, languages and programming (Paderborn, 1996), Springer, Berlin. MR 98e:68123
    • P. Flajolet, X. Gourdon and D. Panario, "Random polynomials and polynomial factorization", Automata, languages and programming (Paderborn, 1996), 232-243, Lecture Notes in Comput. Sci., 1099, Springer, Berlin, 1996. MR 98e:68123.
    • (1996) Lecture Notes in Comput. Sci. , vol.1099 , pp. 232-243
    • Flajolet, P.1    Gourdon, X.2    Panario, D.3
  • 6
    • 0035869860 scopus 로고    scopus 로고
    • Absolute irreducibility of polynomials via Newton polytopes
    • CMP 2001:09
    • S. Gao, "Absolute irreducibility of polynomials via Newton polytopes," J. Algebra 237 (2001), 501-520. CMP 2001:09 (Available at URL: http://www.math.clemson.edu/faculty/Gao).
    • (2001) J. Algebra , vol.237 , pp. 501-520
    • Gao, S.1
  • 7
    • 0035638243 scopus 로고    scopus 로고
    • Decomposition of polytopes and polynomials
    • CMP 2001:13
    • S. Gao and A.G.B. Lauder, "Decomposition of polytopes and polynomials," Discrete and Computational Geometry. 26 (2001), 89-104. CMP 2001:13 (Available at URL: http://www.math.clemson.edu/faculty/Gao).
    • (2001) Discrete and Computational Geometry , vol.26 , pp. 89-104
    • Gao, S.1    Lauder, A.G.B.2
  • 8
    • 0001605828 scopus 로고
    • Computing Frobenius maps and factoring polynomials
    • MR 94d:12011
    • J. Von Zur Gathen and V. Shoup, "Computing Frobenius maps and factoring polynomials", Computational Complexity 2 (1992), 187-224. MR 94d:12011.
    • (1992) Computational Complexity , vol.2 , pp. 187-224
    • Von Zur Gathen, J.1    Shoup, V.2
  • 10
    • 0032365366 scopus 로고    scopus 로고
    • Subquadratic-time factoring of polynomials over finite fields
    • MR 99m:68097
    • E. Kaltofen and V. Shoup, "Subquadratic-time factoring of polynomials over finite fields", Math. Comp. 67 (1998), no. 223, 1179-1197. MR 99m:68097.
    • (1998) Math. Comp. , vol.67 , Issue.223 , pp. 1179-1197
    • Kaltofen, E.1    Shoup, V.2
  • 11
    • 0016495356 scopus 로고
    • Multivariate polynomial factorization
    • MR 53:335a
    • D.R. Musser, "Multivariate polynomial factorization", J. ACM 22 (1975), 291-308. MR 53:335a.
    • (1975) J. ACM , vol.22 , pp. 291-308
    • Musser, D.R.1
  • 12
    • 34250459760 scopus 로고
    • Schnelle Multiplikation großer Zahlen
    • MR 45:1431
    • A. Schönhage and V. Strassen, "Schnelle Multiplikation großer Zahlen", Computing 7 (1971), 281-292. MR 45:1431.
    • (1971) Computing , vol.7 , pp. 281-292
    • Schönhage, A.1    Strassen, V.2
  • 13
    • 0010659663 scopus 로고
    • Factoring polynomials over large finite fields
    • MR 90i:11141
    • D. Wan, "Factoring polynomials over large finite fields", Moth. Comp. 54 (1990), No. 190, 755-770. MR 90i:11141.
    • (1990) Moth. Comp. , vol.54 , Issue.190 , pp. 755-770
    • Wan, D.1
  • 14
    • 0000210144 scopus 로고
    • An improved multivariate polynomial factorization algorithm
    • MR 58:27887b
    • P.S. Wang, "An improved multivariate polynomial factorization algorithm", Moth. Comp. 32 (1978), 1215-1231. MR 58:27887b.
    • (1978) Moth. Comp. , vol.32 , pp. 1215-1231
    • Wang, P.S.1
  • 15
    • 0000468752 scopus 로고
    • Factoring multivariate polynomials over the integers
    • MR 53:335b
    • P.S. Wang and L.P. Rothschild, "Factoring multivariate polynomials over the integers," Math. Comp. 29 (1975), 935-950. MR 53:335b.
    • (1975) Math. Comp. , vol.29 , pp. 935-950
    • Wang, P.S.1    Rothschild, L.P.2
  • 16
    • 0000625977 scopus 로고
    • On Hensel factorization I
    • MR 39:4120
    • H. Zassenhaus, "On Hensel factorization I", J. Number Theory 1 (1969), 291-311. MR 39:4120.
    • (1969) J. Number Theory , vol.1 , pp. 291-311
    • Zassenhaus, H.1

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