Abstract
Let ≤ r be any reductibility and let C be any complexity class. Recall that a set A is said to be C-≤r-hard if, for each set B ∈ C, it holds that B ≤ r A. If A ∈ C and A is c-≤r-hard, then we say that A is C-≤r-complete. When ≤r is ≤ pm we will simply write C-hard and C-complete.
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
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hemaspaandra, L.A., Torenvliet, L. (2003). Hardness for Complexity Classes. In: Theory of Semi-Feasible Algorithms. Monographs in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05080-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-05080-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07581-0
Online ISBN: 978-3-662-05080-4
eBook Packages: Springer Book Archive