A sublinear parallel algorithm for some dynamic programming problems

AbstractThis paper presents a sublinear parallel algorithm for dynamic programming problems such as computing an optimal order of matrix multiplications, an optimal binary search tree or an optimal triangulation of polygons. An algorithm was presented in Rytter (1988) which runs in O(log2n) time using O(n6/log n) processors. An algorithm is presented in this paper which runs in O(√nlogn) time using O(n3.5/log n) processors on a CREW PRAM. Amongst known sublinear algorithms, this is an improvement by a factor of O(n2 log n) in terms of processor-time product