20 citations · 43 across the 10 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012★ 7 cited
New lower bounds for the rank of matrix multiplication
J. M. Landsberg
The rank of the matrix multiplication operator for nxn matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least n^2-o(n^2).…
math.AG2012★ 6 cited
Padded polynomials, their cousins, and geometric complexity theory
Harlan Kadish, J. M. Landsberg
We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes…