메뉴 건너뛰기




Volumn 187, Issue 1-2, 1997, Pages 105-116

On square-free factorization of multivariate polynomials over a finite field

Author keywords

Finite field; Multivariate polynomial; Square free factorization

Indexed keywords

ALGORITHMS; FORMAL LOGIC;

EID: 0031272266     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00059-5     Document Type: Article
Times cited : (6)

References (12)
  • 2
    • 0346639766 scopus 로고
    • On an implementation of multivariate factorization over finite fields, poster
    • L. Bernardin, M.B. Monagan, On an implementation of multivariate factorization over finite fields, poster, ISSAC 95, 1995.
    • (1995) ISSAC 95
    • Bernardin, L.1    Monagan, M.B.2
  • 4
    • 0029194056 scopus 로고
    • On computing greatest common divisors with polynomials given by black boxes for their evaluations
    • A.H.M. Levelt (Ed.), ACM Press, New York
    • A. Diaz, E. Kaltofen, On computing greatest common divisors with polynomials given by black boxes for their evaluations, in: A.H.M. Levelt (Ed.), ISSAC '95: Proc. Internat. Symp. on Symbolic and Algebraic Computation, 1995, ACM Press, New York, pp. 232-239.
    • (1995) ISSAC '95: Proc. Internat. Symp. on Symbolic and Algebraic Computation , pp. 232-239
    • Diaz, A.1    Kaltofen, E.2
  • 8
    • 0003340059 scopus 로고
    • The Art of Computer Programming
    • Addison-Wesley, Reading, MA
    • D.E. Knuth, The Art of Computer Programming, Seminumerical Algorithms, vol. 2, Addison-Wesley, Reading, MA, 1981.
    • (1981) Seminumerical Algorithms , vol.2
    • Knuth, D.E.1


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