Thanks to W. Stein, I could run Giac on cocalc server during the last 3 months, improve the Groebner basis source code, and eventually I could solve the huge cyclic10 benchmark on Q : 2225 primes were required for Chinese remaindering, 217G of memory, and more than 200 sequential days computation (10 days real time). For more details, see this report <https://hal.archives-ouvertes.fr/hal-02081648> Giac source code: https://www-fourier.ujf-grenoble.fr/~parisse/debian/dists/stable/main/source/giac_1.5.0-49.tar.gz
-- 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.
