Arithmetic Branching Programs with Memory
From MaRDI portal
Publication:2849952
DOI10.1007/978-3-642-40313-2_59zbMath1398.68184arXiv1303.1969OpenAlexW2159761555MaRDI QIDQ2849952
Publication date: 20 September 2013
Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.1969
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
The arithmetic complexity of tensor contraction ⋮ Unnamed Item ⋮ Variants of the determinant polynomial and the \textsf{VP}-completeness