A new faster algorithm for factoring skew polynomials over finite fields
type: Item
instance of: scholarly article
title: A new faster algorithm for factoring skew polynomials over finite fields
zbMATH Open document ID: 1373.16046
author: Xavier Caruso
author: Jérémy Le Borgne
published in: Journal of Symbolic Computation
publication date: 2017-02-03T00:00:00Z
Mathematics Subject Classification ID: 16S36
Mathematics Subject Classification ID: 16Z05
Mathematics Subject Classification ID: 16H05
zbMATH DE Number: 6680379
zbMATH Keywords: skew polynomial
zbMATH Keywords: factorization
zbMATH Keywords: Azumaya algebra
MaRDI profile type: Publication
full work available at URL: j.jsc.2016.02.016
OpenAlex ID: W2306849934
cites work: Q4023148
cites work: On Maximally Central Algebras
cites work: Q4331740
cites work: A fast algorithm for computing the characteristic polynomial of the p-curvature
cites work: Theory of codes with maximum rank distance
cites work: Factoring in skew-polynomial rings over finite fields
cites work: Q5580864
cites work: Q3931565
cites work: Q3679336
cites work: Finite-Dimensional Division Algebras over Fields
cites work: Subquadratic-time factoring of polynomials over finite fields
cites work: Q3215315
cites work: Powers of tensors and fast matrix multiplication
cites work: Derangements and Eigenvalue-Free Elements in Finite Classical Groups
cites work: Theory of non-commutative polynomials
cites work: Q5682437
cites work: Q4406533
cites work: Composition collisions and projective polynomials
DOI: 10.1016/J.JSC.2016.02.016
description: scientific article; zbMATH DE number 6680379