Randomness, Invariants and Complexity

This workshop combines various goals: to study different aspects of randomness in linear algebra computations (smoothed analysis, derandomization), to review the asymptotic spectrum and tensor rank with its connections to quantum information, and finally to review geodesic optimization algorithms for null cone membership that led to the derandomization of polynomial identity testing in the noncommutative world. Researchers from different communities will exchange their expertise on these problems.