Abstract
We show that there are families of polynomials having small depth-two arithmetic circuits that cannot be expressed by algebraic branching programs of width two. This clarifies the complexity of the problem of computing the product of a sequence of two-by-two matrices, which arises in several settings.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal M, Allender E, Datta S (2000) On TC0, AC0, and Arithmetic Circuits. Journal of Computer and System Sciences 60: 395–421
M. Agrawal, R. Gurjar, A. Korwar & N. Saxena (2015).Hitting- Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM Journal on Computing 44(3), 669–697. doi:10.1137/140975103.
E. Allender (2004). Arithmetic Circuits and Counting Complexity Classes. In Complexity of Computations and Proofs, J. Krajíček, editor, volume 13 of Quaderni di Matematica, 33–72. Seconda Università di Napoli.
A. Ambainis, E. Allender, D. A. M. Barrington, S. Datta & H. LêThanh (1999). Bounded Depth Arithmetic Circuits: Counting and Closure. In Proc. ICALP, number 1644 in Lecture Notes in Computer Science, 149–158. Springer.
D. A. Barrington (1985). Width-3 Permutation Branching Programs. Technical Report Technical Memorandum MIT/LCS/TM-293, MIT.
M. Ben-Or & R. Cleve (1988). Computing Algebraic Formulas Using a Constant Number of Registers. In Proc. ACM Symp. on Theory of Computing (STOC), 254–257.
Ben-Or M, Cleve R (1992) Computing Algebraic Formulas Using a Constant Number of Registers. SIAM Journal on Computing 21(1): 54–58
Caussinus H, McKenzie P, Thérien D, Vollmer H (1998) Nondeterministic NC1 computation. Journal of Computer and System Sciences 57: 200–212
M. J. Jansen, M. Mahajan & B. V. Raghavendra Rao (2013). Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits. Computational Complexity 22(3), 517–564.
H. Jung (1985). Depth efficient transformations of arithmetic into Boolean circuits. In Proc. FCT, number 199 in Lecture Notes in Computer Science, 167–173. Springer.
Lipton R, Zalcstein Y (1977) Word problems solvable in logspace. Journal of the ACM 24: 522–526
Mahajan M, Raghavendra Rao B.V (2013) Small Space Analogues of Valiant’s Classes and the Limitations of Skew Formulas. Computational Complexity 22(1): 1–38
Meena Mahajan, Nitin Saurabh & Karteek Sreenivasaiah (2012). Counting paths in planar width 2 branching programs. In Proc. 18th Computing: The Australasian Theory Symposium, (CATS 2012), volume 128 of CRPIT, 59–68. Australian Computer Society.
N. Nisan (1991). Lower Bounds for Non-Commutative Computation (Extended Abstract). In Proc. ACM Symp. on Theory of Computing (STOC), 410–418.
D. Robinson (1993). Parallel algorithms for group word problems. Ph.D. thesis, Univ. of California, San Diego.
C. Saha, R. Saptharishi & N. Saxena (2009). The Power of Depth 2 Circuits over Algebras. In Proc. Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), 371–382.
Chandan Saha (2011). Private communication.
L. Valiant (1979). Completeness classes in algebra. In Proc. ACM Symp. on Theory of Computing (STOC), 249–261.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Allender, E., Wang, F. On the power of algebraic branching programs of width two. comput. complex. 25, 217–253 (2016). https://doi.org/10.1007/s00037-015-0114-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-015-0114-7