Broadcasts.com - "Automating Resolution is NP-Hard" (Banff International Research Station (BIRS))

Science
RELATED

Automating Resolution is NP-Hard

Published: Jan. 22, 2020, 5:55 p.m.

Albert Atserias speaking at the BIRS workshop 20w5144: Proof Complexity (Jan 19 - Jan 24). Recorded by the Banff International Research Station for Mathematical Innovation and Discovery.