|Computer Science/Discrete Mathematics Seminar II|
|Topic:||Deeper Combinatorial Lower Bounds|
|Speaker:||Siu Man Chan|
|Date:||Tuesday, January 21|
|Time/Room:||10:30am - 12:30pm/S-101|
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.