Re: [sage-devel] Re: A Sage interface for FGb (Gröbner bases)

2018-12-09 Thread parisse
Le dimanche 9 décembre 2018 20:44:30 UTC+1, Dima Pasechnik a écrit : > > On Sun, Dec 9, 2018 at 1:42 PM parisse > wrote: > > > > Efficient code does not depend on how you handle it (git, svn or > tarballs or whatever). > > Efficiency of handling code does depend upon this; fixing a trivial

Re: [sage-devel] Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

2018-12-09 Thread Steven Craighead
I'm trying to install cryptominisat for SAGEMATH 8.4. I'm hitting a wall. Any advice? On Sun, Dec 9, 2018 at 10:20 AM Steven Craighead wrote: > Equations three through six in keqs are nonlinear. I would expect if you > left the var1 order alone and permuted the order of the equations you

Re: [sage-devel] Re: A Sage interface for FGb (Gröbner bases)

2018-12-09 Thread Dima Pasechnik
On Sun, Dec 9, 2018 at 1:42 PM parisse wrote: > > Efficient code does not depend on how you handle it (git, svn or tarballs or > whatever). Efficiency of handling code does depend upon this; fixing a trivial C++ issue in Giac takes 10 times longer (and takes 10 times more time and effort from

Re: [sage-devel] Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

2018-12-09 Thread Steven Craighead
Equations three through six in keqs are nonlinear. I would expect if you left the var1 order alone and permuted the order of the equations you might even get different answers. For instance if you swapped equation one with equation nine, you might get the same answer with the standard order

Re: [sage-devel] Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

2018-12-09 Thread Steven Craighead
Isn’t this like a situation that requires Groebner bases? Your equations can’t be solved when your variables go from 0 to 28, but can from 28 to 0. This might be a neat little research problem figuring out why you need a specific order on your variable list. Sent from my iPad > On Dec 9,

[sage-devel] Bug in sage.sat.boolean_polynomials.solve() with CryptoMiniSat 5.0.1

2018-12-09 Thread Jörg-Volker
Just a reminder that there's still a bug in the communication with the experimental package CryptoMiniSat 5.0.1 when used via the function sage.sat.boolean_polynomials.solve(). In the following example no solution of the boolean equation system is not found: varl = ['k{0}'.format(p) for p in

Re: [sage-devel] Re: A Sage interface for FGb (Gröbner bases)

2018-12-09 Thread parisse
Efficient code does not depend on how you handle it (git, svn or tarballs or whatever). And I don't think different practices is the real reason why Giac was/is mostly ignored here. After having done a few tests, I think I know why my code on Q is slower with more threads (if the number of

Re: [sage-devel] Re: A Sage interface for FGb (Gröbner bases)

2018-12-09 Thread Dima Pasechnik
On Sun, Dec 9, 2018 at 7:05 AM parisse wrote: > > > > Le samedi 8 décembre 2018 23:44:32 UTC+1, Dima Pasechnik a écrit : >> >> On Sat, Dec 8, 2018 at 5:03 PM parisse wrote: >> >> > and even if I was, I don't want to depend from google or any company for >> > something like that (the risk of IP