Abstract
We present a uniform definition for classes of single- and multi-valued functions. We completely analyze the inclusion structure of function classes. In order to compare classes of multi-valued and single-valued functions with respect to the existence of refinements we extend the so called operator method [VW93,HW00] to make it applicable to such cases. Our approach sheds new light on well-studied classes like NPSV and NPMV, allows to give simpler proofs for known results, and shows that the spectrum of function classes closely resembles the spectrum of well-known complexity classes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Monographs in Theoretical Computer Science. Springer-Verlag, 1988. 2nd edition 1995.
R. Beigel, J. Gill, and U. Hertrampf. Counting classes: Thresholds, parity, mods, and fewness. In Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science, pages 49–57. Springer-Verlag Lecture Notes in Computer Science #415, February 1990.
R. Book, T. Long, and A. Selman. Quantitative relativizations of complexity classes. SIAM Journal on Computing, 13(3):461–487, 1984.
R. Book, T. Long, and A. Selman. Qualitative relativizations of complexity classes. Journal of Computer and System Sciences, 30:395–413, 1985.
CGH+88._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.
FGH+96._S. Fenner, F. Green, S. Homer, A. Selman, T. Thierauf, and H. Vollmer. Complements of multivalued functions. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 260–269. IEEE Computer Society Press, June 1996.
S. Fenner, S. Homer, M. Ogiwara, and A. Selman. Oracles that compute values. SIAM Journal on Computing, 26(4):1043–1065, 1997.
A. Große and H. Hempel. On functions and relations. Technical Report Math/Inf/01/03, Institut für Informatik, Friedrich-Schiller-Universität Jena, Jena, Germany, January 2003.
H. Hempel. Functions in complexity theory. Habilitation Thesis, Friedrich-Schiller-Universität Jena, Jena, Germany, January 2003.
HHN+95._L. Hemaspaandra, A. Hoene, A. Naik, M. Ogiwara, A. Selman, T. Thierauf, and J. Wang. Nondeterministically selective sets. International Journal of Foundations of Computer Science, 6(4):403–416, 1995.
L. Hemaspaandra, A. Naik, M. Ogihara, and A. Selman. Computing solutions uniquely collapses the polynomial hierarchy. SIAM Journal on Computing, 25(4):697–708, 1996.
L. Hemaspaandra and H. Vollmer. The satanic notations: Counting classes beyond # · P and other definitional adventures. SIGACT News, 26(1):2–13, 1995.
U. Hertrampf, H. Vollmer, and K. Wagner. On the power of number-theoretic operations with respect to counting. In Proceedings of the 10th Structure in Complexity Theory Conference, pages 299–314. IEEE Computer Society Press, June 1995.
H. Hempel and G. Wechsung. The operators min and max on the polynomial hierarchy. International Journal of Foundations of Computer Science, 11(2):315–342, 2000.
J. Köbler, U. Schöning, and J. Torán. On counting and approximation. Acta Informatica, 26:363–379, 1989.
S. Kosub, H. Schmitz, and H. Vollmer. Uniformly defining complexity classes of functions. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, pages 607–617. Springer-Verlag Lecture Notes in Computer Science #1373, 1998.
A. Meyer and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of the 13th IEEE Symposium on Switching and Automata Theory, pages 125–129, 1972.
A. Meyer and L. Stockmeyer. Word problems requiring exponential time. In Proceedings of the 5th ACM Symposium on Theory of Computing, pages 1–9, 1973.
C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
C. Papadimitriou and M. Yannakakis. The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences, 28(2):244–259, 1984.
A. Selman. Much ado about functions. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 198–212. IEEE Computer Society Press, June 1996.
L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1–22, 1977.
H. Vollmer and K. Wagner. The complexity of finding middle elements. International Journal of Foundations of Computer Science, 4:293–307, 1993.
G. Wechsung. On the boolean closure of NP. Technical Report TR N/85/44, Friedrich-Schiller-Universität Jena, December 1985.
G. Wechsung. Vorlesungen zur Komplexitätstheorie. Teubner-Texte zur Informatik. B.G. Teubner, Stuttgart, 2000. in german.
O. Watanabe and S. Toda. Polynomial time 1-Turing reductions from #PH to #P. Theoretical Computer Science, 100(1):205–221, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Große, A., Hempel, H. (2003). On Functions and Relations. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds) Discrete Mathematics and Theoretical Computer Science. DMTCS 2003. Lecture Notes in Computer Science, vol 2731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45066-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-45066-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40505-4
Online ISBN: 978-3-540-45066-5
eBook Packages: Springer Book Archive