Abstract
We study the query-complexity of counting, selecting, and sorting functions. That is, for a given set A and a positive integer k, we ask, how many queries to an arbitrary oracle does a polynomial-time machine on input (x 1, x 2,..., x k ) need to determine how many strings of the input are in A. We also ask how many queries are necessary to select a string in A from the input (x 1, x 2,..., x k ) if such a string exists and to sort the input (x 1, x 2,..., x k ) with respect to the ordering x ≼ y if and only if x ∈ A ⇒ y ∈ A. We obtain optimal query-bounds for these problems, and show that sets for which these functions have a low query-complexity must be easy in some sense. For such sets we obtain optimal placements in the extended low hierarchy. We also show that in the case of NP-complete sets the lower bounds for counting and selecting hold unless P=NP. Finally, we relate these notions to cheatability and p-superterseness. Our results yield as corollaries extensions of previously know results.
Research supported by a Deutsche Forschungsgesellschaft Postdoktorandenstipendium.
Preview
Unable to display preview. Download preview PDF.
References
A. Amir, R. Beigel, and W. Gasarch. Some connections between bounded query classes and non-uniform complexity. In Proceedings 5th Structure in Complexity Theory Conference, pages 232–243. IEEE Computer Society Press, 1990.
A. Amir and W. Gasarch. Polynomial terse sets. Information and Computation, 77:37–55, 1988.
J. Balcázar, R. Book, and U. Schöning. Sparse sets, lowness, and highness. SIAM Journal on Computing, 15:739–747, 1986.
J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer Verlag, 1988.
R. Beigel. A structural theorem that depends quantitavely on the complexity of SAT. In Proceedings 2nd Structure in Complexity Theory Conference, pages 28–32. IEEE Computer Society Press, 1987.
R. Beigel. NP-hard sets are p-superterse unless R=NP. Technical Report 88-04, Johns Hopkins University, Baltimore, MD, USA, 1988.
R. Beigel. Bounded queries to SAT and the boolean hierachy. Theoretical Computer Science, 84(2):199–224, 1991.
J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6):1232–1252, 1988.
R. Chang. On the structure of bounded queries to arbitrary NP sets. In Proceedings 4th Structure in Complexity Theory Conference, pages 250–258. IEEE Computer Society Press, 1989.
R. P. Dilworth. A decomposition theorem for partially ordered sets. Ann. of Math., 51:161–166, 1950.
W. Gasarch. Bounded queries in recursion theory: A survey. In Proceedings 6th Structure in Complexity Theory Conference, pages 62–78. IEEE Computer Society Press, 1991.
W. Gasarch, L. Hemachandra, and A. Hoene. On checking versus evaluating multiple queries. Information and Computation. To appear.
L. Hemachandra. The strong exponential hierarchy collapses. Journal of Computer and System Sciences, 39(3):299–322, 1989.
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935–938, 1988.
J. Kadin. PNP[log n] and sparse Turing complete sets for NP. Journal of Computer and System Sciences, 39:282–298, 1989.
D. Knuth. The Art of Computer Programming III. Addison Wesley, second edition, 1973.
M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36:490–509, 1988.
S. Mahaney. Sparse complete sets for NP: solution to a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences, 25:130–143, 1982.
C. Papadimitriou and S. Zachos. Two remarks on the power of counting. In Proceedings 6th GI Conference on Theoretical Computer Science, pages 269–276. Springer-Verlag Lecture Notes in Computer Science #145, 1983.
U. Schöning. A low and a high hierarchy in NP. Journal of Computer and system sciences, 27:14–28, 1983.
A. Selman. Some observations on NP real numbers and P-selective sets. Journal of Computer and System Sciences, 23:326–332, 1981.
A. Selman. Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. Information and Control, 1:36–51, 1982.
R. Szelepcsényi. The method of forced enumeration for nondeterministic automata. Acta Informatica, 26:279–284, 1988.
K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833–846, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoene, A., Nickelsen, A. (1993). Counting, selecting, and sorting by query-bounded machines. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive