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(log2 n) time, but not likely in O(log n) time.
CITATION STYLE
Ibarra, O. H., & Trân, N. Q. (1994). On the parallel complexity of solving recurrence equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 469–477). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_213
Mendeley helps you to discover research relevant for your work.