Matrix complexity and Approximation

In the talk we will consider some problems related to two classical notions of the Approximation theory: Kolmogorov widths and n-term approximation. We will show connections of these notions with matrix complexity measures that originated in the Complexity theory. Also some corollaries on widths and n-term approximations that use methods and constructions from matrix complexity theory will be provided.