12 search results - page 1 / 3 » On factorization of multivariate polynomials over algebraic ... |
78
Voted
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
ADG
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. This paper describes a complete implementation of Ritt-Wu's characteristic sets method in the Maple system. The implemented algorithms include those with variants fo...
ISSAC
1997
Springer
15 years 1 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which ...
STOC
1998
ACM
15 years 1 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...