Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.
Coding with skew polynomial rings.Journal of Symbolic Compu- tation, 44(12):1644–1656, 2009
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields
Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.