Deeper Combinatorial Lower Bounds

Deeper Combinatorial Lower Bounds - Siu Man Chan

Siu Man Chan
Princeton University
January 21, 2014
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.