On 1-BP complexity of satisfiable Tseitin formulas and how it relates to regular resolution
Dmitry Itsykson speaking at the BIRS workshop 20w5144: Proof Complexity (Jan 19 - Jan 24). Recorded by the Banff International Research Station for Mathematical Innovation and Discovery.