The complexity of tensor calculus
From MaRDI portal
Publication:1413648
DOI10.1007/s00037-000-0170-4zbMath1033.15025OpenAlexW3167560924MaRDI QIDQ1413648
Carsten Damm, Pierre McKenzie, Markus Holzer
Publication date: 17 November 2003
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-000-0170-4
complexitycompletenessword problempermanenttensor calculusmultilinear algebraBoolean semiringpolytime algorithmcounting classesalgebraic Turing machineTensor formula
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
The arithmetic complexity of tensor contraction ⋮ Tensors masquerading as matchgates: relaxing planarity restrictions on Pfaffian circuits ⋮ Processing succinct matrices and vectors ⋮ Tensor network contractions for \#SAT ⋮ Picturing Counting Reductions with the ZH-Calculus ⋮ Generalized counting constraint satisfaction problems with determinantal circuits ⋮ Characterizing Valiant's algebraic complexity classes ⋮ Unnamed Item ⋮ A common algebraic description for probabilistic and quantum computations
This page was built for publication: The complexity of tensor calculus
