Broadcasts.com - "Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs" (Banff International Research Station (BIRS))

Science
RELATED

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs

Published: Jan. 24, 2020, 1:04 a.m.

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