Abstract
This chapter is the first one on our quest for structural properties that can distinguish between complexity classes: the existence of hard languages with low density. Our main result establishes the logical completeness of this approach for separating polynomial time from logarithmic space using reductions with a bounded number of queries. Similar techniques apply to various other complexity classes, in the deterministic as well as in the randomized setting.
This is a preview of subscription content, log in via an institution to check access.
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
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
van Melkebeek, D. (2000). 4. Sparseness of Complete Languages. In: Randomness and Completeness in Computational Complexity. Lecture Notes in Computer Science, vol 1950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44545-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-44545-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41492-6
Online ISBN: 978-3-540-44545-6
eBook Packages: Springer Book Archive