On the parallel complexity of solving recurrence equations

  • Oscar H. Ibarra
  • Nicholas Q. Trân
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)

Abstract

We show that recurrence equations, even the simple ones, are not likely to admit fast parallel algorithms, i.e., not likely to be solvable in polylogarithmic time using a polynomial number of processors. We also look at a restricted class of recurrence equations and show that this class is solvable in O(log2n) time, but not likely in O(log n) time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CKS81]
    A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. JACM, 28(1):114–133, 1981.CrossRefGoogle Scholar
  2. [Coo85]
    S. A. Cook. A taxonomy of problems with fast parallel algorithms. Information and Control, 64:2–22, 1985.CrossRefGoogle Scholar
  3. [HU79]
    J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass., 1979.Google Scholar
  4. [Iba91]
    O. H. Ibarra. On resetting DLBA's. SIGACT News, 22(1):62–63, 1991.Google Scholar
  5. [IJCR91]
    O. H. Ibarra, T. Jiang, J. H. Chang, and B. Ravikumar. Some classes of languages in NC 1. Information and Computation, 90(1):86–106, 1991.CrossRefGoogle Scholar
  6. [Imm88]
    N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935–938, 1988.CrossRefGoogle Scholar
  7. [IPS90]
    O. H. Ibarra, T-C. Pong, and S. M. Sohn. String processing on the hypercube. IEEE Trans. on Acoustics, Speech, and Signal Processing, 38:160–164, 1990.Google Scholar
  8. [IWJ93]
    O. H. Ibarra, H. Wang, and T. Jiang. On efficient parallel algorithms for solving set recurrence equations. Journal of Algorithms, 14(2):244–257, 1993.Google Scholar
  9. [Jaj92]
    J. Jaja. An Introduction to Parallel Algorithms. Addison-Wesley, Reading, Mass., 1992.Google Scholar
  10. [JL76]
    N. Jones and W. Lasser. Complete problems for deterministic polynomial time. Theoretical Computer Science, 3(1):105–117,1976.CrossRefGoogle Scholar
  11. [LN82]
    J. Van Leeuwen and M. Nivat. Efficient recognition of rational relations. Information Processing Letter, 14:34–38, 1982.Google Scholar
  12. [RS90]
    S. Ranka and S. Sahni. String editing on an SIMD hypercube multicomputer. Journal of Parallel and Distributed Computing, 9(4):411–418, 1990.Google Scholar
  13. [Ruz81]
    Walter L. Ruzzo. On uniform circuit complexity. Journal of Computer and System Sciences, 22:365–383, 1981.CrossRefGoogle Scholar
  14. [UG88]
    J. Ullman and A. Van Gelder. Parallel complexity of logical query programs. Algorithmic, 3:5–42, 1988.Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Oscar H. Ibarra
    • 1
  • Nicholas Q. Trân
    • 2
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta Barbara
  2. 2.IBM, V81A/B664Research Triangle Park

Personalised recommendations