Efficient computation of the characteristic polynomial
From MaRDI portal
Publication:5262755
DOI10.1145/1073884.1073905zbMath1360.65123arXivcs/0501074MaRDI QIDQ5262755
Jean-Guillaume Dumas, Zhendong Wan, Clément Pernet
Publication date: 16 July 2015
Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0501074
finite field; characteristic polynomial; minimal polynomial; Magma; probabilistic algorithm; integer; Keller-Gehrig
Related Items
Spectral norm of a symmetric tensor and its computation, On the permanental polynomials of matrices, Determinisability of unary weighted automata over the rational numbers, Computational complexity of \(k\)-block conjugacy, Deterministic computation of the characteristic polynomial in the time of matrix multiplication, List decoding of number field codes, Finding Hamming weights without looking at truth tables