On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions

Ji-Won HUH; Shuji ISOBE; Eisuke KOIZUMI; Hiroki SHIZUYA

doi:10.1587/transinf.E96.D.465

Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —

On the Length-Decreasing Self-Reducibility and the Many-One-Like Reducibilities for Partial Multivalued Functions

Ji-Won HUH, Shuji ISOBE, Eisuke KOIZUMI, Hiroki SHIZUYA

Author information

Keywords: partial multivalued function, length-decreasing self-reduction, many-one-like reduction

JOURNAL FREE ACCESS

2013 Volume E96.D Issue 3 Pages 465-471

DOI https://doi.org/10.1587/transinf.E96.D.465

Details

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 (many-one or metric many-one) complete function for NPMV (or NPMV_g) is length-decreasing self-reducible, then any function in NPMV (or NPMV_g) has a polynomial-time computable refinement. This result implies that there exists an NPMV (or NPMV_g)-complete function which is not length-decreasing self-reducible unless P=NP.

Corresponding author

Register with J-STAGE for free!