This is the mail archive of the
gsl-discuss@sources.redhat.com
mailing list for the GSL project.
Re: Solving linear boolean equations
- From: Brian Gough <bjg at network-theory dot co dot uk>
- To: Rainer Dorsch <rainer dot dorsch at informatik dot uni-stuttgart dot de>
- Cc: gsl-discuss at sources dot redhat dot com, schaefls at web dot de
- Date: Thu, 29 Nov 2001 19:01:59 +0000 (GMT)
- Subject: Re: Solving linear boolean equations
- References: <20011129090753.0703337CA4@mx04.nexgo.de>
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