Or compute a Gröbner basis:
sage: P.<x,y> = 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.<x,y> = AffineSpace(GF(2),2)
> sage: S = AA.subscheme(x^2+y^2)
> sage: S.point_set().points()
> [(0, 0), (1, 1)]
>
> On Saturday, December 8, 2012 6:14:19 AM UTC, Santanu wrote:
> > I have a system of non linear equations over GF(2). How to solve
> >
> > them in Sage?
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99
_otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF
_www: http://martinralbrecht.wordpress.com/
_jab: martinralbre...@jabber.ccc.de
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-support?hl=en.
