Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.
Fast multiplication for skew polynomials
3 Pith papers cite this work, alongside 59 external citations. Polarity classification is still indexing.
3
Pith papers citing it
59
external citations · external index
verdicts
UNVERDICTED 3representative citing papers
Projective Kummer-type manifolds with finite-order symplectic birational self-maps acting nontrivially on H² are twisted modular except for Picard rank 3 cases characterized by their NS lattices; specific Mukai vectors are identified for finite-order wall-crossing maps on modular examples.
New bound on Newton polytope support for minimal DEs in polynomial systems enables evaluation-interpolation projection algorithm outperforming prior software.
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.
-
Finite order symplectic birational self-maps on Kummer-type manifolds
Projective Kummer-type manifolds with finite-order symplectic birational self-maps acting nontrivially on H² are twisted modular except for Picard rank 3 cases characterized by their NS lattices; specific Mukai vectors are identified for finite-order wall-crossing maps on modular examples.
-
Projecting dynamical systems via a support bound
New bound on Newton polytope support for minimal DEs in polynomial systems enables evaluation-interpolation projection algorithm outperforming prior software.