Abstract
There has been much research over the last eleven years that considers the number of queries needed to compute a function as a measure of its complexity. We are interested in the complexity of certain sets in this context. We study the sets ODD A n ={(x1,..., x n )∶¦A ∩ {x 1,..., x n }¦ is odd} and WMOD(m) A n ={(x 1,..., x n )∶¦A ∩ {x 1,..., x n}¦≢0 (mod m)}.
If A=K or A is semirecursive, we obtain tight bounds on the query complexity of ODD An and WMOD(m) An . We obtain lower bounds for A r.e. The lower bounds for A r.e. are derived from the lower bounds for A semirecursive. We obtain that every tt-degree has a set A such that ODD A requires n n parallel queries to A, and a set B such that ODD B n can be decided with one query to B. Hence for bounded-query complexity, how information is packaged is more important than Turing degree.
We investigate when extra queries add power. We show that, for several nonrecursive sets A, the more queries you can ask, the more sets you can decide; however, there are sets for which more queries do not help at all.
Supported in part by NSF Grant CCR-8952528 and NSF Grant CCR-9415410.
Supported in part by NSF Grant CCR-9301339.
Supported by the Deutsche Forschungsgemeinschaft (DFG) Grant Am 60/9-1.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. Beigel. Query-Limited Reducibilities. PhD thesis, Stanford University, 1987. Also available as Report No. STAN-CS-88-1221.
R. Beigel, W. Gasarch, J. T. Gill, and J. C. Owings. Terse, superterse, and verbose sets. Information and Computation, 103:68–85, 1993.
R. Beigel, W. Gasarch, and E. Kinber. Frequency computation and bounded queries. Theoretical Computer Science, 1996 (to appear).
J. Cai and L. A. Hemachandra. Enumerative counting is hard. Information and Computation, 82(1):34–44, July 1989.
M. Furst, J. B. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13–27, April 1984.
W. I. Gasarch. A hierarchy of functions with applications to recursive graph theory. Technical Report 1651, University of Maryland, Dept. of Computer Science, 1985.
W. Gasarch. Bounded queries in recursion theory: A survey. In Proc. of the 6th Ann. Conf. on Structure in Comp. Theory, IEEE Comp. Soc. Press, June 1991.
O. Goldreich, N. Nisan, and A. Wigderson. On Yao's xor-lemma. Technical Report TR95-050, Electronic Colloquium on Computational Complexity, 1995.
J. Hastad. Computational Limitations of Small-Depth Circuits. MIT Press, 1987.
C. G. Jockusch. Semirecursive sets and positive reducibility. Transactions of the AMS, 131:420–436, May 1968.
M. Kummer. A proof of Beigel's cardinality conjecture. Journal of Symbolic Logic, 57(2):677–681, June 1992.
M. Kummer and F. Stephan. Effective search problems. Math. Logic Quarterly, 40, 1994.
L. Levin. One way fns and pseudorandom generators. Combinatorica, 7, 1987.
W. Miller and D. A. Martin. The degree of hyperimmune sets. Zeitsch. f. math. Logik und Grundlagen d. Math., 14:159–166, 1968.
P. Odifreddi. Classical Recursion Theory (Volume I). North-Holland, 1989.
R. Smolensky. Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In Proc. of the 19th ACM Sym. on Theory of Comp., 1987.
R. I. Soare. Recursively Enumerable Sets and Degrees. Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beigel, R., Gasarch, W., Kummer, M., Martin, G., McNicholl, T., Stephan, F. (1996). On the query complexity of sets. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_149
Download citation
DOI: https://doi.org/10.1007/3-540-61550-4_149
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61550-7
Online ISBN: 978-3-540-70597-0
eBook Packages: Springer Book Archive