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
computati
>
> This is interesting. One thing we discovered with Maple, which I think
> is known by others, is that when degree drops occur in the modular
> computations, you can stop F4 and output the new polynomials that have
> lower than expected degree, together with a flag saying the computation is
However is in charge of it, take a look...
--
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 em
Le vendredi 29 mars 2019 19:25:05 UTC+1, rpea...@gmail.com a écrit :
>
> This is interesting. One thing we discovered with Maple, which I think
>> is known by others, is that when degree drops occur in the modular
>> computations, you can stop F4 and output the new polynomials that have
>> lo
Hacker News: https://news.ycombinator.com/item?id=19526653
--
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
