Autoreducibility and Completeness for Partial Multivalued Functions

Abstract

SUMMARYIn this paper, we investigate a relationship between manyone-like autoreducibility and completeness for classes of functions computed by polynomial-time nondeterministic Turing transducers. We prove two results. One is that any many-one complete function for these classes is metric many-one autoreducible. The other is that any strict metric manyone complete function for these classes is strict metric many-one autoreducible.