The arithmetic complexity of tensor contraction
From MaRDI portal
(Redirected from Publication:290898)
Recommendations
Cites work
- scientific article; zbMATH DE number 3445419 (Why is no real title available?)
- Arithmetic branching programs with memory
- Arithmetic circuits: the chasm at depth four gets wider
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
- Characterizing Valiant's algebraic complexity classes
- Circuits arithmétiques et calculs tensoriels
- Completeness and reduction in algebraic complexity theory
- Fast Parallel Computation of Polynomials Using Few Processors
- Problems complete for deterministic logarithmic space
- The complexity of acyclic conjunctive queries
- The complexity of tensor calculus
- The complexity of tensor circuit evaluation
- The complexity of weighted counting for acyclic conjunctive queries
- The descriptive complexity approach to LOGCFL
Cited in
(10)- Length Complexity of Tensor Products
- Strassen's Algorithm for Tensor Contraction
- scientific article; zbMATH DE number 1834647 (Why is no real title available?)
- Algorithmic simplification of tensor expressions
- An algorithm to simplify tensor expressions
- Tensor network complexity of multilinear maps
- Circuits arithmétiques et calculs tensoriels
- The complexity of tensor circuit evaluation
- The complexity of tensor calculus
- The arithmetic complexity of tensor contractions
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)