Autoreducibility and Completeness for Partial Multivalued Functions

In this paper, we investigate a relationship between many-one-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 autored...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEICE Transactions on Information and Systems 2017/03/01, Vol.E100.D(3), pp.422-427
Hauptverfasser:	ISOBE, Shuji, KOIZUMI, Eisuke
Format:	Artikel
Sprache:	eng
Schlagworte:	autoreduction Completeness Computation many-one-like reduction Mathematical analysis Mathematical models partial multivalued function Transducers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!