Factoringinskew-polynomialringsoverfinitefields.Journal of Symbolic Computation, 26(4):463–486, 1998

MarkGiesbrecht · 1998 · Journal of Symbolic Computation · DOI 10.1006/jsco.1998.0224 · arXiv 1998.0224

1 Pith paper cite this work, alongside 74 external citations. Polarity classification is still indexing.

1 Pith paper citing it

74 external citations · external index

open at publisher browse 1 citing papers arXiv PDF

representative citing papers

cs.SC · 2026-07-01 · unverdicted · novelty 7.0

Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.

Showing 1 of 1 citing paper.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields cs.SC · 2026-07-01 · unverdicted · none · ref 6
Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.