BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon2021//talk//GNB93V
BEGIN:VEVENT
SUMMARY:Solving discrete problems via Boolean satisfiability with Julia - 
 David P. Sanders
DTSTART:20210728T131000Z
DTEND:20210728T132000Z
DTSTAMP:20260814T221917Z
UID:pretalx-juliacon2021-GNB93V@pretalx.com
DESCRIPTION:Many discrete problems in mathematics and computer science can
  be encoded into Boolean satisfiability (SAT) problems\, and then solved b
 y one of the many SAT "solvers" written in C or C++\, which are now capabl
 e of solving problems with millions of variables. \n\nIn order to understa
 nd the algorithms and trade-offs involved\, we developed a simple SAT solv
 er in pure Julia that is performant for small systems. We also have develo
 ped simple tools to encode discrete problems like sudoku into SAT.
LOCATION:Red
URL:https://pretalx.com/juliacon2021/talk/GNB93V/
END:VEVENT
END:VCALENDAR