I actually tried taking linear combinations of the coefficients, to see if
that would help, after reading the suggestion in a paper. But it turned out
to be so much slower than not doing it, that I abandoned it. However, I
didn't take the size of the coefficients into account, so I certainly
wa
On Saturday, November 12, 2016 at 8:43:57 PM UTC, Frédéric Chapoton wrote:
>
> Hello,
>
> Trying to compile 7.5.b2 with python3 (using export SAGE_PYTHON3=yes), I
> got now the following error:
>
> [sagelib-7.5.beta2] python -c "from sage_setup.autogen.pari import
> rebuild; rebuild()"
> [sagel
Hello,
Trying to compile 7.5.b2 with python3 (using export SAGE_PYTHON3=yes), I
got now the following error:
[sagelib-7.5.beta2] python -c "from sage_setup.autogen.pari import rebuild;
rebuild()"
[sagelib-7.5.beta2] sys:1: RuntimeWarning: not adding directory '' to
sys.path since it's writable
Le samedi 12 novembre 2016 08:16:41 UTC+1, Bill Hart a écrit :
>
>
>
>
> I wonder if it is sometimes worth taking the gcd G of the leading
> coefficients of the original primitive polynomials and then taking the gcd
> H of that with the leading coefficient L of the result of the psr process,
>
On Saturday, November 12, 2016 at 4:00:15 PM UTC, Ralf Stephan wrote:
>
> Sorry for hijacking. Do you know if there exists a (more) efficient
> multivar poly factoring algorithm (than the general one) for factors
> linear in the variables, and coefficients in ZZ? Maybe a geometrical
> method usin
Sorry for hijacking. Do you know if there exists a (more) efficient
multivar poly factoring algorithm (than the general one) for factors
linear in the variables, and coefficients in ZZ? Maybe a geometrical
method using lines?
Regards,
--
You received this message because you are subscribed to th
