LU based algorithms for characteristic polynomial over a finite field

Authors:
Clément Pernet;Zhendong Wan
Affiliations:
LMC-IMAG, Grenoble, France;University of Delaware, Newark, Delaware
Venue:
ACM SIGSAM Bulletin
Year:
2003

Citing 2
Cited 1

Fast algorithms for the characteristic polynomial

Theoretical Computer Science
Finite field linear algebra subroutines

Proceedings of the 2002 international symposium on Symbolic and algebraic computation

Efficient computation of the characteristic polynomial

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear algebra computation over finite fields is important because many symbolic computation problems directly or indirectly rely on linear algebra using efficient finite fields representation.