Factoring and decomposing ore polynomials over F q ( t )
Mark W. Giesbrecht, Yang Zhang · 2003
We present algorithms for computing factorizations and least common left multiple (LCLM) decompositions of Ore polynomials over Fq(t), for a prime power q=pμ. Our algorithms are effective in Fq(t)[D; σ,δ], for any automorphism σ and σ-derivation δ of Fq(t). On input f ∈ Fq(t)[D;σ,δ], the algorithms run in time polynomial in degD(f), degt(f), p and μ.