LU based algorithms for characteristic polynomial over a finite field

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.