5. Modular Squarefree and Greatest Factorial Factorization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3218)
- 354 Downloads
The presentation in this section follows Gerhard (2001). Let Z be a UFD and f ∈ Z[x] nonzero primitive of degree n.
KeywordsCharacteristic Zero Monic Polynomial Single Precision Irreducible Factor Logarithmic Factor
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2004