Abstract

The first session of this talk will take place on Monday, August 31 from 9:30 am – 10:30 am; the second session of this talk will take place on Monday, August 31 from 11:00 am – 12:00 pm.

I will survey the satisfiability algorithms for k-CNF and extensions and explore the connections to lower bounds for depth-3 circuits. I will also provide motivation for ETH and SETH and discuss the Sparsification Lemma.

Video Recording