Ralf Hemmecke wrote:
>
> Hello Johannes,
>
> as one of the authors of the finite field implementation you might
> probably be able to tell me what is happening here, see attachment.
>
> The last
>
> coerce(c2)$F4
>
> takes nearly 18 seconds on my laptop (first time only, of course).
> That's probably due to the computation of the discrete logarithm table.
To answer question "what/why takes time" use profiler. sbcl
profiler shows that time is spent in factorizer. Namely to
really build F4 we need an irreducible polymomial. We compute
it by factoring candidates. It is possible that smarter
selection of candidates would limit work in factoring.
But the main point is that ATM factoring over finite field
extentions is slow (over prime fields we use much better
routine).
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to fricas-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/E1iWjKS-0007sZ-R0%40hera.math.uni.wroc.pl.
