Skip to main content
SpringerLink
Log in

On the Power of Algebraic Branching Programs of Width Two

  • Conference paper
Automata, Languages and Programming (ICALP 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6755))

Included in the following conference series:

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.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, M., Allender, E., Datta, S.: On TC0, AC0, and arithmetic circuits. Journal of Computer and System Sciences 60, 395–421 (2000)

    Article  MathSciNet  Google Scholar 

  2. Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajíček, J. (ed.) Complexity of Computations and Proofs. Quaderni di Matematica, vol. 13, pp. 33–72. Seconda Università di Napoli (2004)

    Google Scholar 

  3. Ambainis, A., Allender, E., Barrington, D.A.M., Datta, S., LêThanh, H.: Bounded depth arithmetic circuits: Counting and closure. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 149–158. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Barrington, D.A.: Width-3 permutation branching programs. Technical Report Technical Memorandum MIT/LCS/TM-293, MIT (1985)

    Google Scholar 

  5. Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. In: Proc. ACM Symp. on Theory of Computing (STOC), pp. 254–257 (1988)

    Google Scholar 

  6. Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. SIAM Journal on Computing 21(1), 54–58 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  7. Caussinus, H., McKenzie, P., Thérien, D., Vollmer, H.: Nondeterministic \(\mbox{\rm NC$^1$}\) computation. Journal of Computer and System Sciences 57, 200–212 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jansen, M.J.: Lower bounds for syntactically multilinear algebraic branching programs. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 407–418. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Jansen, M.J., Raghavendra Rao, B.V.: Simulation of arithmetical circuits by branching programs with preservation of constant width and syntactic multilinearity. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 179–190. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  10. Jung, H.: Depth efficient transformations of arithmetic into Boolean circuits. In: Budach, L. (ed.) FCT 1985. LNCS, vol. 199, pp. 167–173. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  11. Lipton, R., Zalcstein, Y.: Word problems solvable in logspace. Journal of the ACM 24, 522–526 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  12. Mahajan, M., Raghavendra Rao, B.V.: Small-space analogues of valiant’s classes. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 250–261. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Mahajan, M., Saurabh, N., Sreenivasaiah, K.: Counting paths in planar width 2 branching programs (2011) (manuscript)

    Google Scholar 

  14. Nisan, N.: Lower bounds for non-commutative computation (extended abstract). In: Proc. ACM Symp. on Theory of Computing (STOC), pp. 410–418 (1991)

    Google Scholar 

  15. Robinson, D.: Parallel algorithms for group word problems. PhD thesis, Univ. of California, San Diego (1993)

    Google Scholar 

  16. Saha, C., Saptharishi, R., Saxena, N.: The power of depth 2 circuits over algebras. In: Proc. Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), pp. 371–382 (2009)

    Google Scholar 

  17. Saha, C.: Private communication (2011)

    Google Scholar 

  18. Valiant, L.: Completeness classes in algebra. In: Proc. ACM Symp. on Theory of Computing (STOC), pp. 249–261 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Rutgers University, Piscataway, NJ, 08855, USA

    Eric Allender & Fengming Wang

Authors
  1. Eric Allender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fengming Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. ICE-TCS, School of Computer Science, Reykjavik University, Menntavegur 1, IS 101, Reykjavik, Iceland

    Luca Aceto

  2. Fakultät für Informatik, Universität Wien, Universitätsstraße10/9, 1090, Wien, Österreich, Austria

    Monika Henzinger

  3. Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00, Praha 1, Czech Republic

    Jiří Sgall

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Allender, E., Wang, F. (2011). On the Power of Algebraic Branching Programs of Width Two. In: Aceto, L., Henzinger, M., Sgall, J. (eds) Automata, Languages and Programming. ICALP 2011. Lecture Notes in Computer Science, vol 6755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22006-7_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22006-7_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22005-0

  • Online ISBN: 978-3-642-22006-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation