Factoring in skew-polynomial rings over finite fields

Journal of Symbolic Computation

Volumn 26, Issue 4, 1998, Pages 463-486

  Giesbrecht, Mark ^a  

^a UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032185835     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1998.0224     Document Type: Article

References (29)

1. Berlekamp, E. R. (1970). Factoring polynomials over large finite fields. Math. Comp., 24, 713-735.
2. Bronstein, M., Petkovšek, M. (1994). On Ore rings, linear operators and factorisation. Programmirovanie, 20, 27-45.
3. Bronstein, M., Petkovšek, M. (1996). An introduction to pseudo-linear algebra. Theoret. Comput. Sci., 157, 3-33.
4. Cantor, D., Kaltofen, E. (1991). Fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28, 693-701.
5. Cohn, P. (1985). Free Rings and their Relations. London, Academic Press.
6. Coppersmith, D., Winograd, S. (1990). Matrix multiplication via arithmetic progressions. J. Symb. Comput., 9, 251-280.
7. Dickson, L. E. (1901). Linear Groups with an Exposition of the Galois Field Theory. Leipzig, Teubner, 1901; New York, Dover, 1958.
8. Dorey, F., Whaples, G. (1974). Prime and composite polynomials. J. Algebra, 28, 88-101.
9. Gantmacher, F. R. (1990). The Theory of Matrices, Vol. I. New York, Chelsea Publishing Co.
10. Giesbrecht, M. (1992). Factoring in skew-polynomial rings. In Proc. LATIN'92, Sao Paulo, Brasil, pp. 191-203.
11. Grigoriev, D. Y. (1990). Complexity of factoring and calculating GCD of linear differential operators. J. Symb. Comput., 10, 7-37.
12. Hodges, J. H. (1958). Scalar polynomial equations for matrices over a finite field. Duke Math. J., 25, 291-296.
13. Jacobson, N. (1943). The Theory of Rings. New York, American Math. Soc.
14. Kozen, D., Landau, S. (1989). Polynomial decomposition algorithms. J. Symb. Comput., 7, 445-456.
15. Lang, S. (1984). Algebra. Reading, MA, Addison-Wesley.
16. Lidl, R., Niederreiter, H. (1983). Finite Fields, Vol. 20 of Encyclopedia of Mathematics and its Applications. Reading, MA, Addison-Wesley.
17. McDonald, B. (1974). Finite Rings with Identity. New York, Marcel Dekker.
18. Ore, O. (1933). Theory of non-commutative polynomials. Ann. Math., 34, 480-508.
19. Pierce, R. (1982). Associative Algebras. Heidelberg, Springer-Verlag.
20. Rónyai, L. (1987). Simple algebras are difficult. In Proc. 19th ACM Symp. on Theory of Comp., New York, pp. 398-408.
21. Schönhage, A. (1977). Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2. Acta Infor., 7, 395-398.
22. Schönhage, A., Strassen, V. (1971). Schnelle Multiplikation großer Zahlen. Computing, 7, 281-292.
23. Singer, M. F. (1996). Testing reducibility of linear differential operators: a group theoretic perspective. Applicable Algebra Eng. Commun. Computing, 7, 77-104.
24. van der Waerden, B. L. (1970). Algebra, Vol. 1, 7th edn. New York, Frederick Ungar Publishing Co.
25. von zur Gathen, J. (1990a). Functional decomposition of polynomials: the tame case. J. Symb. Comput., 9, 281-299.
26. von zur Gathen, J. (1990b). Functional decomposition of polynomials: the wild case. J. Symb. Comput., 10, 437-452.
27. von zur Gathen, J., Kozen, D., Landau, S. (1987). Functional decomposition of polynomials. In Proc. 28th Ann. IEEE Symp. Foundations of Computer Science, Los Angeles, CA, pp. 127-131.
28. von zur Gathen, J., Shoup, V. (1992). Computing Frobenius maps and factoring polynomials. Computat. Complexity, 2, 187-224.
29. Zippel, R. (1991). Decomposition of rational functions. Preprint: Extended abstract in Proc. ISSAC'91.