Test with x : SUP(INT) := reduce(+,[monomial(i, i)$SUP(INT) for i in 1..(10000)]); )time on x*x;
compare NRECONC(rout,p1) with concat!(reverse! rout, p1) The result is that I can not tell if performance is higer or lower. Maybe the concat! one is faster than NRECONC by 1%, but they are close. So remove NRECONC. -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/fricas-devel. For more options, visit https://groups.google.com/d/optout.
