1996

1998

Learn More

This paper gives an algorithm to factor a polynomial f (in one variable) over rings like Z=rZ for r 2 Z or F q y]=rF q y] for r 2 F q y]. The Chinese Remainder Theorem reduces our problem to the case where r is a prime power. Then factorization is not unique, but if r does not divide the discriminant of f , our (probabilistic) algorithm produces a… (More)

Extended Abstract Abstract This paper gives analgorithm to factor apolynomialf (in one variable) over residue class rings of ZoriFq [y]. The Chi-nese Remainder Theorem reduces our problem to the case where r is a prime power. Then factorization is not unique, but if r does not divide the discriminant of f, our (prob-abilistic) algorithm produces a… (More)

- ‹
- 1
- ›