> < ^ Date: Wed, 02 Jul 2003 20:14:17 +0200
^ From: Massimo Redaelli <turing@inwind.it >
> ^ Subject: Complexity of eigenvalue computations


I'm interested in the problem of finding eigenvalues and eigenvectors of a
matrix over (extensions of) finite fields.
I was wondering what the complexity of the algorithm used in GAP is, and
what the lowest complexity known is for such an algorithm.

Thank you very much for your time.

Massimo Redaelli

> < [top]