Sciweavers

54 search results - page 2 / 11
» Factoring Polynomials over Local Fields II
Sort
View
ISSAC
2009
Springer
269views Mathematics» more  ISSAC 2009»
13 years 11 months ago
On factorization of multivariate polynomials over algebraic number and function fields
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...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
MOC
2000
94views more  MOC 2000»
13 years 4 months ago
Irreducibility testing over local fields
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
P. G. Walsh
FFA
2010
159views more  FFA 2010»
13 years 2 months ago
Parity of the number of irreducible factors for composite polynomials
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...
Ryul Kim, Wolfram Koepf
AAECC
1997
Springer
115views Algorithms» more  AAECC 1997»
13 years 9 months ago
Efficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected det...
Laurent Bernardin, Michael B. Monagan