20 citations · 43 across the 10 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016
On the complexity of the permanent in various computational models
Christian Ikenmeyer, J. M. Landsberg
We answer a question in [Landsberg, Ressayre, 2015], showing the regular determinantal complexity of the determinant det_m is O(m^3). We answer questions in, and generalize results…
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).…