The arithmetic complexity of tensor contraction

DOI10.1007/s00224-015-9630-8zbMath1339.68097OpenAlexW1841088368MaRDI QIDQ290898

Arnaud Durand, Florent Capelli, Stefan Mengel

Publication date: 3 June 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-015-9630-8

zbMATH Keywords

algebraic complexitytensor calculusarithmetic circuits

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• The complexity of weighted counting for acyclic conjunctive queries
• Arithmetic circuits: the chasm at depth four gets wider
• The complexity of tensor calculus
• Completeness and reduction in algebraic complexity theory
• The complexity of tensor circuit evaluation
• Characterizing Valiant's algebraic complexity classes
• Arithmetic Branching Programs with Memory
• Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
• Fast Parallel Computation of Polynomials Using Few Processors
• The complexity of acyclic conjunctive queries
• Circuits arithmétiques et calculs tensoriels
• Problems complete for deterministic logarithmic space
• The descriptive complexity approach to LOGCFL

This page was built for publication: The arithmetic complexity of tensor contraction