Autoreducibility and completeness for partial multivalued functions

    Research output: Contribution to journalArticlepeer-review


    In 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.

    Original languageEnglish
    Pages (from-to)422-427
    Number of pages6
    JournalIEICE Transactions on Information and Systems
    Issue number3
    Publication statusPublished - 2017 Mar


    • Autoreduction
    • Many-one-like reduction
    • Partial multivalued function

    ASJC Scopus subject areas

    • Software
    • Hardware and Architecture
    • Computer Vision and Pattern Recognition
    • Electrical and Electronic Engineering
    • Artificial Intelligence


    Dive into the research topics of 'Autoreducibility and completeness for partial multivalued functions'. Together they form a unique fingerprint.

    Cite this