Abstract
In this chapter we continue to study the nature of parallel computation. The focus now is the limits of the power of parallelism. Thus, in Section 19.1 we prove that there are problems in Pℝ that cannot be efficiently parallelized. These problems are not in NCℝ. Section 19.2 contains lower bound estimates for parallel time in terms of the number of connected components as in Chapter 16.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blum, L., Cucker, F., Shub, M., Smale, S. (1998). Some Separations of Complexity Classes. In: Complexity and Real Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0701-6_19
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0701-6_19
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6873-4
Online ISBN: 978-1-4612-0701-6
eBook Packages: Springer Book Archive