Talk page
Title:
Deeper Combinatorial Lower Bounds
Speaker:
Abstract:
We will discuss space and parallel complexity, ranging from some classical results which motivated the study, to some recent results concerning combinatorial lower bounds in restricted settings. We will highlight some of their connections to boolean complexity, proof complexity, and algebraic complexity.
Link: