Abstract
A set S is sparse if it contains at most polynomially many elements at each length, i.e.,
.
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
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hemaspaandra, L.A., Ogihara, M. (2002). The Self-Reducibility Technique. In: The Complexity Theory Companion. Texts in Theoretical Computer Science An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04880-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-04880-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08684-7
Online ISBN: 978-3-662-04880-1
eBook Packages: Springer Book Archive