Back to Search
Start Over
The Arithmetic Complexity of Tensor Contraction.
- Source :
- Theory of Computing Systems; May2016, Vol. 58 Issue 4, p506-527, 22p
- Publication Year :
- 2016
-
Abstract
- We investigate the algebraic complexity of tensor calculus. We consider a generalization of iterated matrix product to tensors and show that the resulting formulas exactly capture V P, the class of polynomial families efficiently computable by arithmetic circuits. This gives a natural and robust characterization of this complexity class that despite its naturalness is not very well understood so far. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 14324350
- Volume :
- 58
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Theory of Computing Systems
- Publication Type :
- Academic Journal
- Accession number :
- 114325704
- Full Text :
- https://doi.org/10.1007/s00224-015-9630-8