by A. Große, H. Hempel
Preprint series: 03-01, Reports on Computer Science
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 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.
Keywords: complexity theory, functions, relations