Title :
Much ado about functions
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
Abstract :
This paper surveys basic results on complexity classes of partial multivalued functions. We stress basic inclusion relations, interesting hierarchies, and results that demonstrate that hierarchies are extant
Keywords :
computational complexity; multivalued logic; basic inclusion relations; complexity classes; complexity theory; data type; hierarchies; multivalued functions; partial functions; Books; Complexity theory; Computational complexity; Computer science; NP-complete problem; Polynomials; Search problems; Stress; Transducers;
Conference_Titel :
Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on
Conference_Location :
Philadelphia, PA
Print_ISBN :
0-8186-7386-9
DOI :
10.1109/CCC.1996.507682
