Or compute a Gröbner basis:
sage: P. = BooleanPolynomialRing()
sage: Ideal(x^2 + y^2).groebner_basis()
[x + y]
sage: Ideal(x^2 + y^2).variety()
[{y: 0, x: 0}, {y: 1, x: 1}]
On Saturday 08 Dec 2012, Volker Braun wrote:
> I take it you mean polynomial equations:
>
> sage: AA. = AffineSpace(
Thank you. But when I try to solve
f1=x1 + x2 + x4 + x10 + x31 + x43 + x56 ,
f2=x2 + x3 + x5 + x11 + x32 +x44 + x57,
it becomes very slow. Is there any faster approach like
F4 algorithm available in Sage?
On 8 December 2012 17:25, Martin Albrecht wrote:
> Or compute a Gröbner basis:
>
> sage:
On Saturday, December 8, 2012 11:07:31 AM UTC-6, Santanu wrote:
>
> Thank you. But when I try to solve
> f1=x1 + x2 + x4 + x10 + x31 + x43 + x56 ,
> f2=x2 + x3 + x5 + x11 + x32 +x44 + x57,
>
> it becomes very slow. Is there any faster approach like
> F4 algorithm available in Sage?
>
F4 is not
We are talking about the Boolean polynomial ring here, right? So an F4 style
algorithm is used by default (subject to some heuristics). To emphasise you'd
have to construct your ring using the BooleanPolynomialRing constructor.
On Saturday 08 Dec 2012, john_perry_usm wrote:
> On Saturday, Decemb
