skip to main content
research-article

Read-Once Branching Programs for Tree Evaluation Problems

Authors Info & Claims
Published:27 November 2018Publication History
Skip Abstract Section

Abstract

Toward the ultimate goal of separating L and P, Cook, McKenzie, Wehr, Braverman, and Santhanam introduced the Tree Evaluation Problem (TEP). For fixed integers h and k > 0, FTh(k) is given as a complete, rooted binary tree of height h, in which each root node is associated with a function from [k]2 to [k], and each leaf node with a number in [k]. The value of an internal node v is defined naturally; that is, if it has a function f and the values of its two child nodes are a and b, then the value of v is f(a, b). Our task is to compute the value of the root node by sequentially executing this function evaluation in a bottom-up fashion. The problem is obviously in P, and, if we could prove that any branching program solving FTh(k) needs at least kr(h) states for any unbounded function r, then this problem is not in L, thus achieving our goal. The mentioned authors introduced a restriction called thrifty against the structure of BP’s (i,e., against the algorithm for solving the problem) and proved that any thrifty BP needs Ω(kh) states. This article proves a similar lower bound for read-once branching programs, which allows us to get rid of the restriction on the order of nodes read by the BP that is the nature of the thrifty restriction.

References

  1. M. Ajtai, L. Babai, P. Hajnal, J. Komlós, P. Pudlák, V. R odl, E. Szemerédi, and G. Turán. 1986. Two lower bounds for branching programs. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing. Berkeley, California. ACM, 30--38. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. S. Cook. 1974. An observation on time-storage trade off. Journal of Computers and System Science 9, 3 (1974), 308--316. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Cook, P. McKenzie, D. Wehr, M. Braverman, and R. Santhanam. 2012. Pebbles and branching programs for tree evaluation. ACM Transactions on Computation Theory (TOCT) 3, 2 (2012), 4. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Gál, M. Koucký, and P. McKenzie. 2008. Incremental branching programs. Theory of Computing Systems 43, 2 (2008), 159--184. Google ScholarGoogle ScholarCross RefCross Ref
  5. S. Jukna and A. Razborov. 1998. Neither reading few bits twice nor reading illegally helps much. Discrete Applied Mathematics 85, 3 (1998), 223--238. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Jukna and S. Žák. 2003. On uncertainty versus size in branching programs. Theoretical Computer Science 290, 3 (2003), 1851--1867. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Balagopal Komarath and Jayalal Sarma. 2015. Pebbling, entropy, and branching program size lower bounds. ACM Transactions on Computation Theory (TOCT) 7, 2 (2015), 8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. W. Masek. 1976. A Fast Algorithm for the String Editing Problem and Decision Graph Complexity. Ph.D. Dissertation. Massachusetts Institute of Technology.Google ScholarGoogle Scholar
  9. È. Nečiporuk.1998. A Boolean function. In Doklady of the Academy of the USSR, Vol. 169. 765--766. English translation in Soviet Mathematics Doklady 7:4, pp. 999--1000.Google ScholarGoogle Scholar
  10. M. Paterson and C. Hewitt. 1970. Comparative schematology. In Record of the Project MAC Conference on Concurrent Systems and Parallel Computation, Jack B. Dennis (Ed.). ACM, 119--127. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Savický and S. Žák. 2000. A read-once lower bound and a (1,+ k)-hierarchy for branching programs. Theoretical Computer Science 238, 1 (2000), 347--362. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Simon and M. Szegedy. 1993. A new lower bound theorem for read-only-once branching programs and its applications. In Proceedings of a DIMACS Workshop on Advances In Computational Complexity Theory. New Jersey. 13 (1993), 183--193.Google ScholarGoogle Scholar
  13. I. Wegener. 1988. On the complexity of branching programs and decision trees for clique functions. Journal of the ACM (JACM) 35, 2 (1988), 461--471. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Wehr. 2012. Exact size of smallest minimum-depth deterministic BPs solving the tree evaluation problem. (2012). Unpublished. http://www.cs.toronto.edu/∼wehr/.Google ScholarGoogle Scholar
  15. S. Žák. 1984. An exponential lower bound for one-time-only branching programs. In Mathematical Foundations of Computer Science 1984, Michal Chytil and Václav Koubek (Eds.). Springer, 562--566 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Read-Once Branching Programs for Tree Evaluation Problems

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Article Metrics

      • Downloads (Last 12 months)6
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!