The complexity of tensor circuit evaluation

DOI10.1007/s00037-007-0222-0zbMath1173.68021OpenAlexW1981850523MaRDI QIDQ2472427

Markus Holzer, Martin Beaudry

Publication date: 22 February 2008

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-007-0222-0

zbMATH Keywords

complexitycompletenesscounting classesalgebraic Turing machinetensor circuittensor formula

Mathematics Subject Classification ID

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

Related Items

The arithmetic complexity of tensor contraction, Processing succinct matrices and vectors, Unnamed Item