Arithmetic branching programs with memory

DOI10.1007/978-3-642-40313-2_59MaRDI QIDQ2849952zbMATH OpenOpenAlexFDO

Authors Stefan Mengel

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Abstract: We extend the well known characterization of $vpws$ as the class of polynomials computed by polynomial size arithmetic branching programs to other complexity classes. In order to do so we add additional memory to the computation of branching programs to make them more expressive. We show that allowing different types of memory in branching programs increases the computational power even for constant width programs. In particular, this leads to very natural and robust characterizations of $vp$ and $vnp$ by branching programs with memory.

Recommendations

• Succinct algebraic branching programs characterizing non-uniform complexity classes
• scientific article; zbMATH DE number 1335881
• On arithmetic branching programs
• Small-Space Analogues of Valiant’s Classes
• On algebraic branching programs of small width

Cited in

(5)

• scientific article; zbMATH DE number 7559421 (Why is no real title available?)
• Variants of the determinant polynomial and the \textsf{VP}-completeness
• The arithmetic complexity of tensor contraction
• On arithmetic branching programs
• Succinct algebraic branching programs characterizing non-uniform complexity classes

This page was built for publication: Arithmetic branching programs with memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849952)