Testing Polynomials over General Fields
โ Scribed by Kaufman, Tali; Ron, Dana
- Book ID
- 118181325
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2006
- Tongue
- English
- Weight
- 298 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0097-5397
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A recently discovered family of indecomposable polynomials of nonprime power degree over \(\mathbb{F}_{2}\) (which include a class of exceptional polynomials) is set against the background of the classical families and their monodromy groups are obtained without recourse to the classification of fin
We describe an efficient new algorithm for factoring a polynomial ฮฆ(x) over a field k that is complete with respect to a discrete prime divisor. For every irreducible factor ฯ(x) of ฮฆ(x) this algorithm returns an integral basis for k[x]/ฯ(x)k[x] over k.