This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References and Suggested Reading
Cook, S., “The Complexity of Theorem Proving Procedures,” Proc. 3rd ACM Symp. Theory of Computing, 1971, pp. 151–158.
Cormen, T. H., C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990, Chapter 36, pp. 916–963.
Gupta, R., S. A. Smolka, and S. Bhaskar, “On Randomization in Sequential and Distributed Algorithms,” ACM Computing Surveys, Vol. 26, pp. 7–86, March 1994.
Krishnamurthy, E. V., “Complexity Issues in Parallel and Distributed Computing,” Chapter 4 in Parallel and Distributed Computing Handbook, edited by A. Y. Zomaya, McGraw-Hill, 1996, pp. 89–126.
Parberry, I., Parallel Complexity Theory, Pitman, 1987.
Pawlak, Z., J. Grzymala-Busse, R. Slowinski, and W. Ziarko, “Rough Sets,” Communications of the ACM, Vol. 38, No. 11, pp. 89–95, November 1995.
Pippenger, N., “On Simultaneous Resource Bounds,” Proc. 20th Symp. Foundations of Computer Science, 1979, pp. 307–311.
Stewart, I., “Mathematical Recreations: Big Game Hunting in Primeland,” Scientific American, Vol. 276, No. 5, pp. 108–111, May 1997.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). Parallel Algorithm Complexity. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_3
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive