90 citations · 333 across the 51 of their papers we have counts for
3 papers · 1 filter
Complexity of linear circuits and geometry
Fulvio Gesmundo, Jonathan Hauenstein, Christian Ikenmeyer +1
We use algebraic geometry to study matrix rigidity, and more generally, the complexity of computing a matrix-vector product, continuing a study initiated by Kumar, et. al. We (i) e…
Geometric Complexity Theory: an introduction for geometers
J. M. Landsberg
This article is a survey of recent developments in, and a tutorial on, the approach to P v. NP and related questions called Geometric Complexity Theory (GCT). It is written to be a…
Equations for lower bounds on border rank
Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg
We present new methods for determining polynomials in the ideal of the variety of bilinear maps of border rank at most r. We apply these methods to several cases including the case…