Solving linear boolean equations

[Brian Gough]

Rainer Dorsch writes:
 > I am wondering, if gsl is useful for solving large/huge _linear_
 > boolean equations, e.g.
 >  x1+x3=0 x1+x2=1 x2+x3=1
 >  and xi is either 0 or 1 and the result here is read mod 2.

Hi,

GSL concentrates on floating-point routines, so it doesn't have any
solvers for boolean equations.  The GPL-ed program "Pari" can handle
linear systems of modular equations so you could try looking at that.

regards
Brian Gough