Abstract
This 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(log 2 n) time using O( n 6/log n) processors. An algorithm is presented in this paper which runs in O(√ nlog n) time using O( n 3.5/log n) processors on a CREW PRAM. Amongst known sublinear algorithms, this is an improvement by a factor of O( n 2 log n) in terms of processor-time product.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
