Abstract
This chapter asks the question how many languages in exponential time are autoreducible. We will study the problem within the framework of resourcebounded measure, as well as within the context of betting games, a notion which we will develop here and which provides an alternate to resourcebounded measure. Several approaches for separating BPP from EXP will come up. problem
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). 8. The Frequency of Autoreducible 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_8
Download citation
DOI: https://doi.org/10.1007/3-540-44545-5_8
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