On 5/4/24 15:30, Grégory Vanuxem wrote:
As a matter of fact, use of FLINT in FriCAS:
My experience with FLINT is that is uses dense representation for univariate polynomial. That representation makes it fast for multiplication (when polynomials are dense). But I think very spare polynomial will choke it, for example (x^10000000+1)^n (for n is some small integer). ==== So for FriCAS, lacking a dense representation makes it performs very bad at certain tasks (for example, multiplication). The karatsuba method implemented in UnivariatePolynomialMultiplicationPackage is not working at all because of the spare representation we have. - Qian -- 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/cbee840e-8104-4f39-839e-87c91c962cac%40gmail.com.
