The arithmetic complexity of tensor contraction
From MaRDI portal
Publication:290898
DOI10.1007/S00224-015-9630-8zbMATH Open1339.68097OpenAlexW1841088368MaRDI QIDQ290898FDOQ290898
Authors: Florent Capelli, Arnaud Durand, 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
Recommendations
Multilinear algebra, tensor calculus (15A69) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Problems complete for deterministic logarithmic space
- The complexity of weighted counting for acyclic conjunctive queries
- Characterizing Valiant's algebraic complexity classes
- Title not available (Why is that?)
- The complexity of tensor calculus
- Completeness and reduction in algebraic complexity theory
- The complexity of tensor circuit evaluation
- 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
- Arithmetic circuits: the chasm at depth four gets wider
- The descriptive complexity approach to LOGCFL
Cited In (10)
- Title not available (Why is that?)
- Strassen's Algorithm for Tensor Contraction
- Algorithmic simplification of tensor expressions
- Title not available (Why is that?)
- The complexity of tensor calculus
- The arithmetic complexity of tensor contractions
- The complexity of tensor circuit evaluation
- Length Complexity of Tensor Products
- An algorithm to simplify tensor expressions
- Circuits arithmétiques et calculs tensoriels
This page was built for publication: The arithmetic complexity of tensor contraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290898)
