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 speedups obtainable for a number of P-complete problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Ajtai, J. Komlos, andE. Szemeredi, AnO(n logn) sorting network.Combinatorica 3 (1983), 1–19.
R. Anderson, E. Mayr, andM. Warmuth, Parallel approximation schemes for bin packing.Inform. and Comput. 82 (1989), 262–277.
E. Ashcroft andZ. Manna, The translation of “go to” programs to “while” programs. InProc. 1971 IFIP Congress, Amsterdam, The Netherlands, North Holland Publishing Company,1 (1972), 250–255. Reprinted inClassics in Software Engineering, ed.E. N. Yourdan. Yourdan Press, N.Y., 1979.
K. E. Batcher, Sorting networks and their applications. InProc. AFIPS Spring Joint Summer Computer Conference, 1968, 307–314.
Böhm andJacopini, Flow diagrams, Turing machines and languages with only two formation rules.Comm. ACM 9 (5) (1966), 366–371. Reprinted inClassics in Software Engineering, ed. E. N. Yourdan. Yourdan Press, N.Y., 1979.
S. A. Cook andR. A. Reckhow, Time bounded random access machines.J. Comput. System Sci. 7 (1973), 354–375.
S. A. Cook, A taxonomy of problems with fast parallel algorithms.Inform. and Control 64 (1985), 2–22.
C. Dwork, P. C. Kanellakis, andJ. C. Mitchell, On the sequential nature of unification.J. Logic Prog. 1, (1984), 35–50.
S. Fortune and J. Wyllie, Parallelism in random access machines. InProc. 10th Ann. ACM Symp. Theor. Comput., 1978, 114–118.
L. M. Goldschlager, The monotone and planar circuit value problems are log space complete for P.SIGACT News 9 (1977), 25–29.
R. H. Greenlaw, A model classifying algorithms as inherently sequential.Inform. and Comput. 97 (1992), 133–149.
R. H. Greenlaw, J. Hoover, and W. L. Ruzzo,Topics in Parallel Computation: A Guide to P-Completeness Theory. Oxford University Press, 1994. See alsoA compendium of problems complete for P, Department of Computing Sciene Technical Report TR 91-11, University of Alberta, March 1991. Also available as Department of Computer Sciences Technical Report TR 91-14, University of New Hampshire, March 1991 and Department of Computer Science Technical Report TR 91-05-01, University of Washington, May 1991.
R. A. Howard,Dynamic Programming and Markov Processes. MIT Press, Cambridge, 1960.
R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines.Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, Chapter 7, ed.J. van Leeuwen. MIT Press/Elsevier, 1990, 869–941.
C. P. Kruskal, L. Rudolph, andM. Snir, A complexity theory of efficient parallel algorithms.Theoret. Comput. Sci. 71 (1990), 95–132.
R. E. Ladner, The circuit value problem is log space complete for P.SIGACT News 7 (1975), 18–20.
R. E. Ladner andM. J. Fischer, Parallel prefix computation.J. Assoc. Comput. Mach. 27 (1980), 831–838.
C. H. Papadimitriou andJ. N. Tsitsiklis, The complexity of Markov decision processes.Math. Oper. Res. 12 (1987), 441–450.
J. Reif, Depth first search is inherently sequential.Inform. Proc. Lett. 20 (1985), 229–234.
R. A. Simons andJ. S. Vitter, New classes for parallel complexity: a study of unification and other complete problems for P.IEEE Trans. Comput. 35 (1986), 403–418.
C. Slot andP. Van Emde Boas, The problem of space invariance for sequential machines.Inform. and Comput. 77 (1988), 93–122.
L. Snyder, Type architectures, shared memory, and the corollary of modest potential.Annual Review of Computer Science 1 (1986), 289–317
L. Stockmeyer andU. Vishkin, Simulation of parallel random access machines by circuits.SIAM J. Comput. 13 (1985), 862–874.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Condon, A. A theory of strict P-completeness. Comput Complexity 4, 220–241 (1994). https://doi.org/10.1007/BF01206637
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01206637