Hi,
For Givaro, there is no such limitation, the test-suite indeed tests the field
GFqDom with
the 22 bits cardinality 4194301.
Note that there is a misleading error in the class, where maxCardinality()
returns 65536.
This is reported in https://github.com/linbox-team/givaro/issues/121
Fortunate
Just for the record, I'm answering to myself:
> I'm also thinking of Danilevskii's elimination: although it could be
> viewed as a Krylov method, it does not use any randomization, so could
> it always give the whole minpoly ?
I checked that this does not solve our pb: Danilevskii's alg is
deter
Oups,
I missed this discussion.
So I confirm, that we are using the Krylov based dense minpoly that
returns a probabilistic minpoly, and I'm the one to blame for not taking
care of this.
So far, I don't know of any better certificate for minpoly than checking
Pmin(A) = 0 (improved by using the fa
