On the length-decreasing self-reducibility and the many-one-like reducibilities for partial multivalued functions

    Research output: Contribution to journalArticlepeer-review

    1 Citation (Scopus)

    Abstract

    In this paper, we investigate a relationship between the length-decreasing self-reducibility and the many-one-like reducibilities for partial multivalued functions. We show that if any parsimonious (manyone or metric many-one) complete function for NPMV (or NPMVg) is length-decreasing self-reducible, then any function in NPMV (or NPMVg) has a polynomial-time computable refinement. This result implies that there exists an NPMV (or NPMVg)-complete function which is not length-decreasing self-reducible unless P = NP.

    Original languageEnglish
    Pages (from-to)465-471
    Number of pages7
    JournalIEICE Transactions on Information and Systems
    VolumeE96-D
    Issue number3
    DOIs
    Publication statusPublished - 2013 Mar

    Keywords

    • Length-decreasing self-reduction
    • 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

    Fingerprint Dive into the research topics of 'On the length-decreasing self-reducibility and the many-one-like reducibilities for partial multivalued functions'. Together they form a unique fingerprint.

    Cite this