On the Parallel Complexity of Solving Recurrence Equations

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.

[1]  Sartaj Sahni,et al.  String Editing on an SIMD Hypercube Multicomputer , 1990, J. Parallel Distributed Comput..

[2]  Neil D. Jones,et al.  Complete problems for deterministic polynomial time , 1974, Symposium on the Theory of Computing.

[3]  Oscar H. Ibarra.  On resetting DLBA's , 1991, SIGA.

[4]  Stephen A. Cook,et al.  A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..

[5]  Jan van Leeuwen,et al.  Efficient Recognition of Rational Relations , 1982, Inf. Process. Lett..

[6]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[7]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[8]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[9]  Tao Jiang,et al.  On Efficient Parallel Algorithms for Solving Set Recurrence Equations , 1993, J. Algorithms.

[10]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[11]  Tao Jiang,et al.  Some Classes of Languages in NC¹ , 1991, Inf. Comput..

[12]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[13]  Oscar H. Ibarra,et al.  String processing on the hypercube , 1990, IEEE Trans. Acoust. Speech Signal Process..