Title :
Nondeterministic witnesses and nonuniform advice
Author :
Balcázar, José L.
Author_Institution :
Dept. of Software, Univ. Polytech. of Cataluna, Barcelona, Spain
Abstract :
Several results related to nonuniform complexity classes and their comparison with uniform ones are surveyed. The relevance of the main tools in these arguments, namely, self-reducibility structures is explained by showing that the methods for proving relationships between nonuniform and uniform classes, including the so-called round-robin tournament method, can be presented as general properties of self-reducible sets. New results can be obtained from these general properties. One of the mentioned proof techniques is shown to be closely related to the notion of helping
Keywords :
computational complexity; nondeterministic witness; nonuniform advice; nonuniform complexity classes; proving relationships; round-robin tournament method; self-reducibility structures; self-reducible sets; Circuits; Computational modeling; Polynomials; Round robin;
Conference_Titel :
Structure in Complexity Theory Conference, 1989. Proceedings., Fourth Annual
Conference_Location :
Eugene, OR
Print_ISBN :
0-8186-1958-9
DOI :
10.1109/SCT.1989.41833