Complexity of linear circuits and geometry

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Complexity of linear circuits and geometry. / Gesmundo, Fulvio; Ikenmeyer, Christian; Hauenstein, Jonathan D.; Landsberg, Joseph M.

I: Foundations of Computational Mathematics, Bind 16, Nr. 3, 2016, s. 599–635.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Gesmundo, F, Ikenmeyer, C, Hauenstein, JD & Landsberg, JM 2016, 'Complexity of linear circuits and geometry', Foundations of Computational Mathematics, bind 16, nr. 3, s. 599–635. <https://arxiv.org/abs/1310.1362>

APA

Gesmundo, F., Ikenmeyer, C., Hauenstein, J. D., & Landsberg, J. M. (2016). Complexity of linear circuits and geometry. Foundations of Computational Mathematics, 16(3), 599–635. https://arxiv.org/abs/1310.1362

Vancouver

Gesmundo F, Ikenmeyer C, Hauenstein JD, Landsberg JM. Complexity of linear circuits and geometry. Foundations of Computational Mathematics. 2016;16(3):599–635.

Author

Gesmundo, Fulvio ; Ikenmeyer, Christian ; Hauenstein, Jonathan D. ; Landsberg, Joseph M. / Complexity of linear circuits and geometry. I: Foundations of Computational Mathematics. 2016 ; Bind 16, Nr. 3. s. 599–635.

Bibtex

@article{3fdd97b36769453da27b03a960b44a47,
title = "Complexity of linear circuits and geometry",
abstract = "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.",
author = "Fulvio Gesmundo and Christian Ikenmeyer and Hauenstein, {Jonathan D.} and Landsberg, {Joseph M.}",
year = "2016",
language = "English",
volume = "16",
pages = "599–635",
journal = "Foundations of Computational Mathematics",
issn = "1615-3375",
publisher = "Springer",
number = "3",

}

RIS

TY - JOUR

T1 - Complexity of linear circuits and geometry

AU - Gesmundo, Fulvio

AU - Ikenmeyer, Christian

AU - Hauenstein, Jonathan D.

AU - Landsberg, Joseph M.

PY - 2016

Y1 - 2016

N2 - 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.

AB - 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.

M3 - Journal article

VL - 16

SP - 599

EP - 635

JO - Foundations of Computational Mathematics

JF - Foundations of Computational Mathematics

SN - 1615-3375

IS - 3

ER -

ID: 189700549