Abstract
In this chapter we investigate the complexity of C A n for various n and A. We consider not only the query complexity of C A n as defined in Chapter 3, i.e., the least m such that there exists a set X for which C A n ∈ FQ(m,X), but also the number of queries to A itself that are required to compute C A n . (Note that, numerically speaking, the former complexity cannot exceed the latter.)
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
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gasarch, W.I., Martin, G.A. (1999). The Complexity of C A n . In: Bounded Queries in Recursion Theory. Progress in Computer Science and Applied Logic, vol 16. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0635-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0635-4_4
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6848-2
Online ISBN: 978-1-4612-0635-4
eBook Packages: Springer Book Archive