The Stone transformation interprets a Boolean formula
as a set of polynomials with coefficients in
F_{2}. I will explain how this set
of polynomials can be analyzed in order to determine if the
original Boolean formula is satisfiable. The talk is
intended for computer scientists who are familiar with the
SAT problem.