Abstract
The problem \(FT^{h}_{d}(k)\) consists in computing the value in [k] = {1,...,k} taken by the root of a balanced d-ary tree of height h whose internal nodes are labelled with d-ary functions on [k] and whose leaves are labelled with elements of [k]. We propose \({FT^{h}_{d}(k)}\) as a good candidate for witnessing \({\mathbf{L}} \subsetneq{\mathbf{LogDCFL}}\). We observe that the latter would follow from a proof that k-way branching programs solving \({FT^{h}_{d}(k)}\) require \(\Omega(k^{\mbox{\scriptsize unbounded function}(h)})\) size. We introduce a “state sequence” method that can match the size lower bounds on \(FT^{h}_{d}(k)\) obtained by the Nec̆iporuk method and can yield slightly better (yet still subquadratic) bounds for some nonboolean functions. Both methods yield the tight bounds Θ(k 3) and Θ(k 5/2) for deterministic and nondeterministic branching programs solving \(FT^{3}_{2}(k)\) respectively. We propose as a challenge to break the quadratic barrier inherent in the Nec̆iporuk method by adapting the state sequence method to handle \(FT^{4}_{d}(k)\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borodin, A., Cook, S.: A time-space tradeoff for sorting on a general sequential model of computation. SIAM J. Comput. 11(2), 287–297 (1982)
Borodin, A., Razborov, A., Smolensky, R.: On lower bounds for read-k-times branching programs. Computational Complexity 3, 1–18 (1993)
Cook, S.: An observation on time-storage trade off. J. Comput. Syst. Sci. 9(3), 308–316 (1974)
Cook, S., Sethi, R.: Storage requirements for deterministic polynomial time recognizable languages. J. Comput. Syst. Sci. 13(1), 25–37 (1976)
Gál, A., Koucký, M., McKenzie, P.: Incremental branching programs. Theory Comput. Syst. 43(2), 159–184 (2008)
Goldreich, O.: Computational Complexity: A Conceptual Perspective. Cambridge University Press, Cambridge (2008)
Karchmer, M., Raz, R., Wigderson, A.: Super-logarithmic depth lower bounds via direct sum in communication complexity. Computational Complexity 5, 191–204 (1991); An abstract appeared in the 6th Structure in Complexity Theory Conference (1991)
Mahajan, M.: Polynomial size log depth circuits: between NC 1and AC 1. Bulletin of the EATCS 91, 30–42 (2007)
Nečiporuk, È.: On a boolean function. Doklady of the Academy of the USSR 169(4), 765–766 (1966); English translation in Soviet Mathematics Doklady 7(4), 999–1000
Nordström, J.: New wine into old wineskins: A survey of some pebbling classics with supplemental results (2009), http://people.csail.mit.edu/jakobn/research/
Paterson, M., Hewitt, C.: Comparative schematology. In: Record of Project MAC Conference on Concurrent Systems and Parallel Computations, pp. 119–128. ACM, New Jersey (1970)
Pudlák, P.: The hierarchy of boolean circuits. Computers and artificial intelligence 6(5), 449–468 (1987)
Razborov, A.: Lower bounds for deterministic and nondeterministic branching programs. In: 8th Internat. Symp. on Fundamentals of Computation Theory, pp. 47–60 (1991)
Sudborough, H.: On the tape complexity of deterministic context-free languages. J. ACM 25(3), 405–414 (1978)
Taitslin, M.A.: An example of a problem from PTIME and not in NLogSpace. In: Proceedings of Tver State University (2005); Applied Mathematics, vol. 6(12) (2), pp. 5–22. Tver State University, Tver (2005)
Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications. Soc. for Industrial and Applied Mathematics, Philadelphia (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braverman, M., Cook, S., McKenzie, P., Santhanam, R., Wehr, D. (2009). Branching Programs for Tree Evaluation. In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-03816-7_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03815-0
Online ISBN: 978-3-642-03816-7
eBook Packages: Computer ScienceComputer Science (R0)