Explicit tensors

DOI10.1007/978-3-319-05446-9_6MaRDI QIDQ2821697zbMATH OpenOpenAlexFDO

Authors Markus Bläser

Publication date 22 September 2016

Published in Perspectives in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-05446-9_6

zbMATH Keywords

lower boundsalgebraic complexity theorytensor rank

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Ranks of tensors and a generalization of secant varieties
• On the generic and typical ranks of 3-tensors
• Representation of tensors by matrices
• On the complexity of finding tensor ranks
• Abelian tensors

Cites work

• A Lower Bound for the Formula Size of Rational Functions

Cited in

(9)

• A note on the gap between rank and border rank
• On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
• Subrank and optimal reduction of scalar multiplications to generic tensors
• Non-interactive commitment from non-transitive group actions
• Abelian tensors
• Tensor rank is hard to approximate
• The tensor hierarchy simplified
• scientific article; zbMATH DE number 7009617 (Why is no real title available?)
• Weighted slice rank and a minimax correspondence to Strassen's spectra

This page was built for publication: Explicit tensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821697)