School of
Electrical Engineering
and Computer Science
KTH / CSC / Theory Group / Jakob Nordström / Teaching / DD3501 Current Research in Proof Complexity 2011/12 / Guest lecture Feb 13

The SAT Problem and Boolean Gröbner Bases

Lecturer: Samuel Lundqvist, Stockholm University
Time and date: Monday February 13, 13:15-15:00
Location: Seminar room 1537


The Stone transformation interprets a Boolean formula as a set of polynomials with coefficients in F2. 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.

Web Analytics Made Easy -
Published by: Jakob Nordström <jakobn~at-sign~kth~dot~se>
Updated 2021-06-24