Sorry I should have said a system of multivariate polynomials.
Raphael
On Mar 8, 3:59 pm, lesshaste wrote:
> I am having problems simply defining a multivariate polynomial. I have
> a slightly modified excerpt from a very helpful python script I was
> given that looks like
>
> #!
I am having problems simply defining a multivariate polynomial. I have
a slightly modified excerpt from a very helpful python script I was
given that looks like
#!/opt/sage-4.3.3-linux-32bit-ubuntu_9.10-i686-Linux/sage -python
import sys
from sage.all import *
from polybori.blocks import declare
Hi,
On Aug 3, 7:39 pm, Martin Albrecht
wrote:
> > The problem in my case is really one of scale. I have put a larger
> > example at the bottom of this message. When I try to find the
> > groebner basis in sage 4.1 (which seems to use polybori-0.5rc.p8) the
> > memory usage goes over 1.6GB and t
On Aug 2, 2:59 am, john_perry_usm wrote:
> Raphael,
>
> > Also, I read back in April that there was a plan to implement
> > Faugere's F4 algorithm. As the systems I want to solve are very large,
> > I would be particularly interested in that or any related tools that
> > are in development. (An
Thanks very much for the reply.
> Finally, for solving you should use a lexicographical term ordering:
>
> sage: R. =
> BooleanPolynomialRing(order='lex')
> sage: I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 * b211 * c111 +
> : a112 * b212 * c112 - 0 , a121 * b111 * c111 + a122 * b11
I am new to sage and am attempting to solve systems of multivariate
polys over GF(2). My first attempt with a small example is
R.=GF(2)[]
I=(a111 * b111 * c111 + a112 * b112 * c112 - 1 , a111 * b211 * c111 +
a112 * b212 * c112 - 0 , a121 * b111 * c111 + a122 * b112 * c112 ,
a121 * b211 * c111 +
