Yet another practical implementation of polynomial factorization over finite fields

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2002, Pages 200-206

  Noro, Masayuki ^a   Yokoyama, Kazuhiro ^a  

^a KOBE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); HEURISTIC METHODS; POLYNOMIALS;

COMPUTATIONAL MATHEMATICS; HEURISTIC VERSION; POLYNOMIAL FACTORIZATION;

COMPUTATIONAL METHODS;

EID: 0036042305     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780532     Document Type: Conference Paper

References (17)

1. Factorization in Z[χ]: The searching phase
2. Efficient multivariate factorization over finite fields
3. Factorization examples
4. On square-free factorization of multivariate polynomials over a finite field
5. Efficient computation of zero-dimensional Gröbner bases by change of ordering
6. Factoring multivariate polynomials via partial differential equations
7. Factorization of multivariate polynomials over finite fields
8. Factoring polynomials and the knapsack problem
9. Polynomial factorization
10. Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization
11. Polynomial factorization 1987-1991
12. Factoring multivariate integral polynomials
13. Factoring multivariate polynomials over finite fields
14. Factoring polynomials with rational coefficients
15. A computer algebra system Risa/Asir
16. A modular method to compute rational univariate representation of zero-dimensional ideals