English Deutsch Français Italiano Español Português 繁體中文 Bahasa Indonesia Tiếng Việt ภาษาไทย
All categories

1 answers

Factoring a general polynomial can be a very
daunting task. Often one factors it modulo
many small primes and then uses a version
of the Chinese remainder theorem to
construct a factorisation over the integers.
There is an algorithm by Berlekamp that
is useful in this regard.
See D. Knuth, Art of Computer Programming,
Vol. 2, Chapter 4 for complete details.

2007-03-11 08:31:58 · answer #1 · answered by steiner1745 7 · 0 0

fedest.com, questions and answers