Arithmetic Branching Programs with Memory
We extend the well known characterization of the arithmetic circuit class VP ws 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.
KeywordsDirected Acyclic Graph Arithmetic Circuit Polynomial Size Input Gate Output Gate
Unable to display preview. Download preview PDF.
- 3.Brent, R.P.: The complexity of multiple-precision arithmetic. In: Brent, R.P., Andersson, R.S. (eds.) The Complexity of Computational Problem Solving, pp. 126–165. Univ. of Queensland Press (1976)Google Scholar
- 5.Bürgisser, P.: Completeness and reduction in algebraic complexity theory. Springer (2000)Google Scholar
- 6.Kintali, S.: Realizable paths and the NL vs L problem. Electronic Colloquium on Computational Complexity (ECCC) 17, 158 (2010)Google Scholar
- 9.Mengel, S.: Arithmetic Branching Programs with Memory, arXiv:1303.1969 (2013)Google Scholar
- 10.Nisan, N.: Lower bounds for non-commutative computation. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, p. 418. ACM (1991)Google Scholar
- 12.Toda, S.: Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Information and Systems 75(1), 116–124 (1992)Google Scholar
- 14.Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 249–261. ACM (1979)Google Scholar