The total influence of k-CNFs
Speaker: Chin HoTitle: The total influence of k-CNFs
Date: 22 Sep 2022 17:30-19:00 EST
Location: SEC Level 3 NW Terrace
Food: Pakistani
I will introduce the important concept of total influence of a Boolean function, and give a simple randomized algorithm for SAT. Then I will show how it leads to a short proof that shows every width-w DNF has total influence at most $w$.