Abstract

Border rank is a measure of complexity of a tensor. A fundamental problem in theoretical computer science is to lower bound the border rank of explicit tensors. However, there is a barrier that limits the range of applicability of classical techniques. In the talk I will discuss a recent technique that is not subject to these barriers.