TU Berlin

Fachgebiet Algorithmische AlgebraIn Proceedings

Inhalt des Dokuments

zur Navigation

In Proceedings

The arithmetic complexity of tensor contractions
Zitatschlüssel CDM-The-Arithmetic-Complexity-Of-Tensor-Contractions
Autor Florent Capelli and Arnaud Durand and Stefan Mengel
Buchtitel Proceedings Symposium on Theoretical Aspects of Computer Science (STACS) 2013
Jahr 2013
Zusammenfassung We investigate the algebraic complexity of tensor calulus. We consider a generalization of iterated matrix product to tensors and show that the resulting formulas exactly capture VP, 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.
Link zur Publikation Link zur Originalpublikation Download Bibtex Eintrag



Schnellnavigation zur Seite über Nummerneingabe