Inhalt des Dokuments
In Proceedings
| 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. |
Zusatzinformationen / Extras
Direktzugang
Schnellnavigation zur Seite über Nummerneingabe
Hilfsfunktionen
Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.