Computer Science/Discrete Mathematics Seminar II
Deeper Combinatorial Lower Bounds
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.
Date & Time
January 21, 2014 | 10:30am – 12:30pm
Location
S-101Speakers
Siu Man Chan
Affiliation
Princeton University