New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
SIAM Journal on Computing
Efficient Geometric Algorithms on the EREW PRAM
IEEE Transactions on Parallel and Distributed Systems
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
A Lower Bound to Finding Convex Hulls
Journal of the ACM (JACM)
Multi-List Ranking: Complexity and Applications
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
Better lower bounds on detecting affine and spherical degeneracies
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
| Hi-index | 0.00 |
In this paper, we consider parallelizability of some P-complete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We prove P-completeness of the problem and propose a cost optimal parallel algorithm, according to the parameter. Second we consider a lexicographically first maximal 3 sums problem. We prove P-completeness of the problem by reducing a lexicographically first maximal independent set problem, and propose two cost optimal parallel algorithms for related problems. The above results show that some P-complete problems have efficient cost optimal parallel algorithms.