Advertisement

Algorithmica

, Volume 64, Issue 2, pp 279–294 | Cite as

Counting Paths in VPA Is Complete for #NC 1

  • Andreas Krebs
  • Nutan Limaye
  • Meena Mahajan
Article

Abstract

We give a #NC 1 upper bound for the problem of counting accepting paths in any fixed visibly pushdown automaton. Our algorithm involves a non-trivial adaptation of the arithmetic formula evaluation algorithm of Buss, Cook, Gupta and Ramachandran (SIAM J. Comput. 21:755–780, 1992). We also show that the problem is #NC 1 hard. Our results show that the difference between #BWBP and #NC 1 is captured exactly by the addition of a visible stack to a nondeterministic finite-state automaton.

Keywords

Arithmetic Circuit Polynomial Size Boolean Circuit Input Alphabet Valid Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Allender, E.: Making computation count: arithmetic circuits in the nineties. SIGACT News 28, 2–15 (1997) CrossRefGoogle Scholar
  2. 2.
    Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajicek, J. (ed.) Complexity of Computations and Proofs. Quaderni di Matematica, vol. 13, pp. 33–72. Seconda Universita di Napoli, Napoli (2004). An earlier version appeared in the Complexity Theory Column, SIGACT News 28, 2–15 (1997) Google Scholar
  3. 3.
    Allender, E., Jiao, J., Mahajan, M., Vinay, V.: Non-commutative arithmetic circuits: depth reduction and size lower bounds. Theor. Comput. Sci. 209, 47–86 (1998) MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 202–211 (2004) CrossRefGoogle Scholar
  5. 5.
    Barrington, D.: Bounded-width polynomial size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38, 150–164 (1989) MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Ben-Or, M., Cleve, R.: Computing algebraic formulas using a constant number of registers. SIAM J. Comput. 21, 54–58 (1992) MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Braunmuhl, B.V., Verbeek, R.: Input-driven languages are recognized in log  n space. In: Conference on Fundamentals of Computation Theory (FCT 1983), pp. 40–51 (1983) Google Scholar
  8. 8.
    Brent, R.P.: The parallel evaluation of general arithmetic expressions. J. ACM 21, 201–206 (1974) MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Buss, S.: The Boolean formula value problem is in ALOGTIME. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 123–131 (1987) Google Scholar
  10. 10.
    Buss, S., Cook, S., Gupta, A., Ramachandran, V.: An optimal parallel algorithm for formula evaluation. SIAM J. Comput. 21(4), 755–780 (1992) MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Caussinus, H., McKenzie, P., Thérien, D., Vollmer, H.: Nondeterministic NC1 computation. J. Comput. Syst. Sci. 57, 200–212 (1998). Preliminary version in Proceedings of the 11th IEEE Conference on Computational Complexity, pp. 12–21 (1996) MATHCrossRefGoogle Scholar
  12. 12.
    Chiu, A., Davida, G., Litow, B.: Division in logspace-uniform NC1. RAIRO Theor. Inform. Appl. 35, 259–276 (2001) MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Dymond, P.W.: Input-driven languages are in log n depth. Inf. Process. Lett. 26, 247–250 (1988) MathSciNetCrossRefGoogle Scholar
  14. 14.
    Jung, H.: Depth efficient transformations of arithmetic into boolean circuits. In: Fundamentals of Computation Theory, FCT ’85, pp. 167–174 (1985) CrossRefGoogle Scholar
  15. 15.
    Limaye, N., Mahajan, M., Meyer, A.: On the complexity of membership and counting in height-deterministic pushdown automata. In: 3rd International Computer Science Symposium in Russia CSR. LNCS, vol. 5010, pp. 240–251. Springer, Berlin (2008) Google Scholar
  16. 16.
    Limaye, N., Mahajan, M., Rao, B.V.R.: Arithmetizing classes around NC1 and L. In: Proceedings of the 24th Annual Conference on Theoretical Aspects of Computer Science. LNCS, vol. 4393, pp. 477–488 (2007) Google Scholar
  17. 17.
    Limaye, N., Mahajan, M., Rao, B.V.R.: Arithmetizing classes around NC\(^{\mbox{1}}\) and L. Theory Comput. Syst. 46(3), 499–522 (2010) MathSciNetMATHCrossRefGoogle Scholar
  18. 18.
    Mehlhorn, K.: Pebbling mountain ranges and its application to DCFL recognition. In: 7th International Colloquium on Automata, Languages and Programming (ICALP 80), pp. 422–432 (1980) CrossRefGoogle Scholar
  19. 19.
    Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 249–261. ACM, New York (1979) CrossRefGoogle Scholar
  20. 20.
    Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, New York (1999) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.University of TübingenTübingenGermany
  2. 2.Indian Institute of Technology BombayMumbaiIndia
  3. 3.The Institute of Mathematical SciencesChennaiIndia

Personalised recommendations