Abstract
After introducing the polynomial time m-reducibility and the logarithmic space m-reducibility in Chapter 3, in this chapter we shall introduce other types of reducibilities and related considerations, like the properties of sets of low density and the concept of self-reducible set.
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
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Balcázar, J.L., Díaz, J., Gabarró, J. (1988). Time Bounded Turing Reducibilities. In: Structural Complexity I. EATCS Monographs on Theoretical Computer Science Series, vol 11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-97062-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-97062-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-97064-1
Online ISBN: 978-3-642-97062-7
eBook Packages: Springer Book Archive