BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211208T164412Z
LOCATION:Level 2 - Lobby
DTSTART;TZID=America/Los_Angeles:20211208T180000
DTEND;TZID=America/Los_Angeles:20211208T190000
UID:dac_DAC 2021_sess243_WIP128@linklings.com
SUMMARY:Determining the Multiplicative Complexity of Boolean Functions usi
 ng SAT
DESCRIPTION:Networking Reception, Work-in-Progress Poster\n\nDetermining t
 he Multiplicative Complexity of Boolean Functions using SAT\n\nSoeken\n\nW
 e present a constructive SAT-based algorithm to determine the multiplicati
 ve complexity of a Boolean function, i.e., the smallest number of AND gate
 s in any logic network that consists of 2-input AND gates, 2-input XOR gat
 es, and inverters. In order to speed-up solving time, we make use of sever
 al symmetry breaking constraints; these exploit properties of XAGs that ma
 y be useful beyond the proposed SAT-based algorithm. Our algorithm is capa
 ble to find all optimum XAGs for representatives of all 5-input affine-equ
 ivalent classes, and for a set of frequently occurring 6-input functions.\
 n\nVirtual Program: Presented In-Person
END:VEVENT
END:VCALENDAR