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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
APA
Allender, E., & Wang, F. (2011). On the power of algebraic branching programs of width two. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6755 LNCS, pp. 736–747). https://doi.org/10.1007/978-3-642-22006-7_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free