Advertisement

Parallel complexity of iterated morphisms and the arithmetic of small numbers

  • Carsten Damm
  • Markus Holzer
  • Klaus-Jörn Lange
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 629)

Abstract

We improve several upper bounds to the complexity of the membership problem for languages defined by iterated morphisms (D0L systems). The complexity bounds are expressed in terms of DLOGTIME-uniform circuit families. We prove: 1) For polynomially growing DOL systems the membership problem is contained in AC 0. 2) For arbitrary DOL systems the membership problem is contained in NC 1. 3) The latter can be improved to TC 0 if and only if upper bounds to a number of natural arithmetic problems can be improved to TC 0. 4) The general D0L membership problem (the D0L system is part of the input) is contained in Cook's class DET.

Keywords

Arithmetic Problem Membership Problem Boolean Circuit Circuit Family Derivation Length 
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]
    D. A. M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC 1. Journal of Computer and System Sciences, 41:274–306, 1990.zbMATHMathSciNetCrossRefGoogle Scholar
  2. [2]
    R. V. Book. Sparse sets, tally sets, and polynomial reducibilities. In Proc.of 13th MFCS, volume 324 of LNCS, pages 1–13. Springer, 1988.Google Scholar
  3. [3]
    S. R. Buss. The boolean formula value problem is in ALOGTIME. In Proc. 19th Ann. ACM Symp. on Theory of Computing, pages 123–131, 1987.Google Scholar
  4. [4]
    A. K. Chandra, L. Stockmeyer, and U. Vishkin. Constant depth reducibility. SIAM Journal on Computing, 13(2):423–439, May 1984.zbMATHMathSciNetCrossRefGoogle Scholar
  5. [5]
    S. A. Cook. Towards a complexity theory of synchronous parallel computation. L'Enseignement Mathématique, XXVII(1–2):75–100, 1981.Google Scholar
  6. [6]
    S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64(1–3):2–22, 1985.zbMATHMathSciNetCrossRefGoogle Scholar
  7. [7]
    A. Ehrenfeucht and G. Rozenberg. D0L system with rank. In L Systems, volume 15 of LNCS, pages 136–141. Springer, 1974.Google Scholar
  8. [8]
    M. Furst, J. B. Saxe, and M. Sipser. Parity circuits and the polynomial-time hierarchy. In Proc. 22th IEEE Symp. FOCS, pages 260–270, 1981.Google Scholar
  9. [9]
    A. Hajnal, W. Maass, P. Pudlak, M. Szegedy, and G. Turan. Threshold circuits of bounded detph. In Proc. 28th IEEE Symp. FOCS, pages 99–110, 1987.Google Scholar
  10. [10]
    J. Hartmanis. Some observations about NP complete sets. In Proc. of 6th FCT, volume 278 of LNCS, pages 185–196. Springer, 1987.Google Scholar
  11. [11]
    B. Jenner and B. Kirsig. Alternierung und Logarithmischer Platz. Dissertation (in German), Universität Hamburg, 1989.Google Scholar
  12. [12]
    N. D. Jones and S. Skyum. Recognition of deterministic ET0L languages in logarithmic space. Information and Computation, 35:177–181, 1977.zbMATHMathSciNetGoogle Scholar
  13. [13]
    N. D. Jones and S. Skyum. Complexity of some problems concerning L systems. Math. Systems Theory, 13:29–43, 1979.zbMATHMathSciNetCrossRefGoogle Scholar
  14. [14]
    N. D. Jones and S. Skyum. A note on the complexity of general D0L membership. SIAM Journal on Computing, 10(1):114–117, February 1981.zbMATHMathSciNetCrossRefGoogle Scholar
  15. [15]
    Jan Van Leeuwen. The membership problem for ET0L-languages is polynomially complete. Information Processing Letters, 3(5):138–143, May 1975.zbMATHCrossRefGoogle Scholar
  16. [16]
    G. Rozenberg and A. Salomaa. The Mathematical Theory of L Systems, volume 90. Academic Press, 1980.Google Scholar
  17. [17]
    W. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365–338, 1981.zbMATHMathSciNetCrossRefGoogle Scholar
  18. [18]
    I. Sudborough. The time and tape complexity of developmental languages. In Proc. of 4th ICALP, volume 52 of LNCS, pages 509–521. Springer, 1977.Google Scholar
  19. [19]
    P. M. B. Vintányi. Lindenmayer Systems: Structure, Languages, and Growth Functions. PhD thesis, University of Amsterdam, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Carsten Damm
    • 1
  • Markus Holzer
    • 1
  • Klaus-Jörn Lange
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchen 2Germany

Personalised recommendations