Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Stochastic Algorithms

SAGA 2005: Stochastic Algorithms: Foundations and Applications pp 190–201Cite as

The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach

  • Conference paper

  • 743 Accesses

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

Abstract

We present a survey of the communication point of view for a complexity lower bounds proof technique for classical (deterministic, nondeterministic and randomized) and quantum models of branching programs.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 157, 139–159 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ablayev, F.: Randomization and nondeterminism are incomparable for ordered-read once branching programs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 195–202. Springer, Heidelberg (1997)

    Google Scholar 

  3. Ablayev, F., Karpinski, M.: On the power of randomized branching programs. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol. 1099, pp. 348–356. Springer, Heidelberg (1996)

    Google Scholar 

  4. Ablayev, F., Karpinski, M.: On the Power of Randomized Ordered Branching Programs. Electronic Colloquium on Computational Complexity, TR98-004 (1998), available at http://www.eccc.uni-trier.de/eccc/

  5. Ablayev, F., Karpinski, M.: A lower bound for integer multiplication on randomized ordered read-once branching programs. Information and Computation 186(1), 78–89 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ablayev, F., Gainutdinova, A., Karpinski, M.: On the computational power of quantum branching programs. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 59–70. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Agrawal, M., Thierauf, T.: The Satisfiability Problem for Probabilistic Ordered Branching Programs. Electronic Colloquium on Computational Complexity, TR97-060 (1997), available at http://www.eccc.uni-trier.de/eccc/

  8. Boppana, R., Sipser, M.: The complexity of finite functions. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, pp. 757–804. MIT Press, Elsevier, The Netherlands (1990)

    Google Scholar 

  9. Bryant, R.: On the complexity of VLSI implementations and graph representations of boolean functions with applications to integer multiplication. IEEE Trans. Comput. 40(2), 205–213 (1991)

    Article  MathSciNet  Google Scholar 

  10. Bryant, R.: Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24(3), 293–318 (1992)

    Article  Google Scholar 

  11. Borodin, A., Razborov, A., Smolensky, R.: On lower bounds for read-k-times branching programs. Computational Complexity 3, 1–18 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  12. Bolling, B., Sauerhoff, M., Sieling, D., Wegener, I.: On the power of different types of restricted branching programs. ECCC Reports 1994, TR94-025 (1994), Available at http://www.eccc.uni-trier.de/eccc/

  13. Jukna, S.: Complexity of Boolean Functions, see. Electronic Colloquium on Computational Complexity, section Lecture Notes, available at http://www.eccc.uni-trier.de/eccc/

  14. Hromkovic, J.: Communication complexity and parallel computations. Springer, Heidelberg (1997)

    Google Scholar 

  15. Karchmer, M., Raz, R., Wigderson, A.: Super-logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. Computational Complexity 5, 191–204 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Klauck, H.: On quantum and probabilistic communication: La Vegas and one-way protocols. In: Proc. of the 32nd ACM Symp. Theory of Computing (2000)

    Google Scholar 

  17. Kremer, I., Nisan, N., Ron, D.: On randomized one-round communication complexity. In: Proceedings of the 27th annual ACM symposium on Theory of computing, pp. 596–605 (1995)

    Google Scholar 

  18. Krause, M., Meinel, C., Waack, S.: Separating the eraser Turing machine classes L e , NL e , co − NL e , and P e . In: Koubek, V., Janiga, L., Chytil, M.P. (eds.) MFCS 1988. LNCS, vol. 324, pp. 405–413. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  19. Kushilevitz, E., Nisan, N.: Communication comple xity. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  20. Meinel, C., Theobald, T.: Ordered Binary Decision Diagrams and Their Significance in Computer-Aided Design of VLSI Circuits - a Survey, Electronic Colloquium on Computational Complexity, TR98-039, available at http://www.eccc.uni-trier.de/eccc

  21. Nakanishi, M., Hamaguchi, K., Kashiwabara, T.: Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 467–476. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  23. Oklonishnikova, E.: On one lower bound for branching programs. Electronic Colloquium on Computational Complexity, TR02-020, available at http://www.eccc.uni-trier.de/eccc

  24. Ponzio, S.: A lower bound for integer multiplication with read-once branching programs. In: Proceedings of the 27-th STOC, pp. 130–139 (1995)

    Google Scholar 

  25. Ponzio, S.: Restricted Branching Programs and Hardware Verification, PhD Theses, Massachusetts Institute of Technology (1995), Available at http://www.eccc.uni-trier.de/eccc

  26. Razborov, A.: Lower bounds for deterministic and nondeterministic branching programs. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 47–60. Springer, Heidelberg (1991)

    Google Scholar 

  27. Raz, R., McKenzie, P.: Separation of the monotone NC hierarchy. In: Proc. of the 38th Annual Symposium on Foundation of Computer Science, pp. 234–243 (1997)

    Google Scholar 

  28. Sauerhoff, M.: A lower bounds for randomized read-k-times branching programs Electronic Colloquium on Computational Complexity, TR97-019 (1997), available at http://www.eccc.uni-trier.de/eccc/

  29. Savicky, P., Zak, S.: A large lower bound for 1-branching programs, Electronic Colloquium on Computational Complexity, Revision 01 of TR96-036 (1996), available at http://www.eccc.uni-trier.de/eccc/

  30. Savicky, P., Zak, S.: A hierarchy for (1, + k)-branching programs with respect to k, Electronic Colloquium on Computational Complexity, TR96-050 (1996), available at http://www.eccc.uni-trier.de/eccc/

  31. Simon, J., Szegedy, M.: A new lower bound theorem for read-only-once branching programs and its applications. In: Cai, J.-Y. (ed.) Advances in Computational Complexity Theory. DIMACS Series, vol. 13, pp. 183–193. AMS (1993)

    Google Scholar 

  32. Sauerhoff, M., Sieling, D.: Quantum branching programs and space-bounded nonuniform quantum complexity. ph/0403164 (March 2004)

    Google Scholar 

  33. Wegener, I.: Efficient data structures for boolean functions. Discrete Mathematics 136, 347–372 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  34. Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications (2000)

    Google Scholar 

  35. Yao, A.: Some Complexity Questions Related to Distributive Computing. In: Proceedings of the 11th Annual ACM Symposium on the Theory of Computing, pp. 209–213 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Theoretical Cybernetics, Kazan State University, 420008, Kazan, Russia

    Farid Ablayev

Authors
  1. Farid Ablayev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Discrete Mathematics, Leninskie Gory, Moscow State University, 119992, Moscow, Russia

    Oleg B. Lupanov  & Oktay M. Kasim-Zade  & 

  2. Faculty of Mechanics and Mathematics, Department of Discrete Mathematics, Leninskie Gory, Moscow State University, 119992, Moscow, Russia

    Alexander V. Chaskin

  3. Department of Computer Science, King’s College London, WC2R 2LS, London, UK

    Kathleen Steinhöfel

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ablayev, F. (2005). The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach. In: Lupanov, O.B., Kasim-Zade, O.M., Chaskin, A.V., Steinhöfel, K. (eds) Stochastic Algorithms: Foundations and Applications. SAGA 2005. Lecture Notes in Computer Science, vol 3777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11571155_16

Download citation

  • DOI: https://doi.org/10.1007/11571155_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29498-6

  • Online ISBN: 978-3-540-32245-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation