I have improved the sparse multivariate factorization algorithm in giac 1.2.2-101, it will factor the given polynomial in about 2s. It is based on a simple idea of comparing a few bivariate factorizations, it is explained here https://hal.archives-ouvertes.fr/hal-01394062 in order to help other open-source systems to implement it if they wish.
-- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
