Uniformly Defining Complexity Classes of Functions


We introduce a general framework for the definition of function classes. Our model, which is based on polynomial time nondeterministic Turing transducers, allows uniform characterizations of FP, FPNP, counting classes (# P, # NP, # coNP, GapP, GapPNP), optimization classes (max P, min P, max NP, min NP), promise classes (NPSV, #few P, c# P), multivalued… (More)
DOI: 10.1007/BFb0028595


1 Figure or Table

Cite this paper

@inproceedings{Kosub1998UniformlyDC, title={Uniformly Defining Complexity Classes of Functions}, author={Sven Kosub and Heinz Schmitz and Heribert Vollmer}, booktitle={STACS}, year={1998} }