Complexity of linear circuits and geometry

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

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) exhibit many non-obvious equations testing for (border) rigidity, (ii) compute degrees of varieties associated to rigidity, (iii) describe algebraic varieties associated to families of matrices that are expected to have super-linear rigidity, and (iv) prove results about the ideals and degrees of cones that are of interest in their own right.
TidsskriftFoundations of Computational Mathematics
Udgave nummer3
Sider (fra-til)599–635
StatusUdgivet - 2016
Eksternt udgivetJa


ID: 189700549