Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Explicit Tensors

From MaRDI portal
Publication:2821697
Jump to:navigation, search

DOI10.1007/978-3-319-05446-9_6zbMath1345.68151OpenAlexW4235547491MaRDI QIDQ2821697

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 boundstensor rankalgebraic complexity theory


Mathematics Subject Classification ID

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


Related Items (6)

A note on the gap between rank and border rank ⋮ Abelian tensors ⋮ On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry ⋮ Weighted slice rank and a minimax correspondence to Strassen's spectra ⋮ Tensor Rank is Hard to Approximate ⋮ Unnamed Item



Cites Work

  • A Lower Bound for the Formula Size of Rational Functions


This page was built for publication: Explicit Tensors

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2821697&oldid=15741043"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki