I will survey some elementary (to state!) problems on groups,
matrices, and tensors, and discuss their motivations arising from
several major problems in computational complexity theory. On each
problem there was some exciting recent progress which...
This paper proves the first super-logarithmic lower bounds on
the cell-probe complexity of dynamic boolean (a.k.a. decision) data
structure problems, a long-standing milestone in data structure
lower bounds.