Abstract
A serious limitation of the theory of P-completeness is that it fails to distinguish between those P-complete problems that do have polynomial speedup on parallel machines from those that don't. We introduce the notion of strict P-completeness and develop tools to prove precise limits on the possible speedup obtainable for a number of P-complete problems.
Work supported by NSF grant number CCR-9100886
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Anderson, R., E. Mayr and M. Warmuth. Parallel Approximation Schemes for Bin Packing, Information and Computation, 82(3):262–277, 1989.
Cook, S. A. and R. A. Reckhow. Time bounded random access machines, Journal of Computer and System Sciences, 7(4):354–375, 1973.
Cook, S. A. A taxonomy of problems with fast parallel algorithms, Information and Control, 64(1–3):2–22, 1985.
Dwork, C., P. C. Kanellakis and J. C. Mitchell. On the sequential nature of unification, Journal on Logic Programming, 1:35–50, 1984.
Fortune, S. and J. Wyllie, Parallelism in random access machines. In 10th Annual ACM Symposium on Theory of Computing, 114–118, 1978.
Goldschlager, L. M. The monotone and planar circuit value problems are log space complete for P, SIGACT News, 9(2):25–29, 1977.
Greenlaw, R., H. J. Hoover and W. L. Ruzzo. A Compendium of Problems Complete for P, Department of Computing Science University of Alberta Technical Report TR 90-36, March 1991.
Howard, R. A., Dynamic Programming and Markov Processes, MIT Press, Cambridge, 1960.
Karp, R. M. and V. Ramachandran. A Survey of Parallel Algorithms for Shared-Memory Machines, Handbook of Theoretical Computer Science, North-Holland.
Kruskal, C. P., L. Rudolph and M. Snir. A complexity theory of efficient parallel algorithms, Theoretical Computer Science, 71(1):95–132.
Ladner, R. E., The circuit value problem is log space complete for P. SIGACT News, 7(1):18–20, 1975.
Papadimitriou, C. H. and J. N. Tsitsiklis. The complexity of Markov decision processes, Mathematics of Operations Research, 12(3):441–450, 1987.
Reif, J. Depth first search is inherently sequential, Information Processing Letters, 20(5):229–234, 1985.
Simons and Vitter. New classes for parallel complexity: a study of Unification and Other Complete Problems for P. IEEE Transactions on Computers, 35(5):403–418, 1986.
Slot, C. and P. Van Emde Boas. The problem of space invariance for sequential machines, Information and Computation, 77::93–122, 1988.
Snyder, L. Type architectures, shared memory, and the corollary of modest potential, Annual Review of Computer Science 1:289–317, 1986.
Stockmeyer, L. and U. Vishkin. Simulation of Parallel Random Access Machines by Circuits, SIAM Journal on Computing, 14:862–874, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Condon, A. (1992). A theory of strict P-completeness. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_171
Download citation
DOI: https://doi.org/10.1007/3-540-55210-3_171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55210-9
Online ISBN: 978-3-540-46775-5
eBook Packages: Springer Book Archive