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

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

Research output: Contribution to journal › Article › peer-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 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.

Original language	English
Pages (from-to)	465-471
Number of pages	7
Journal	IEICE Transactions on Information and Systems
Volume	E96-D
Issue number	3
DOIs	https://doi.org/10.1587/transinf.E96.D.465
Publication status	Published - 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

Access to Document

10.1587/transinf.E96.D.465

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

@article{9c2b2befce824a35bdd18b46187e38a1,

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

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.",

keywords = "Length-decreasing self-reduction, Many-one-like reduction, Partial multivalued function",

author = "Huh, {Ji Won} and Shuji Isobe and Eisuke Koizumi and Hiroki Shizuya",

year = "2013",

month = mar,

doi = "10.1587/transinf.E96.D.465",

language = "English",

volume = "E96-D",

pages = "465--471",

journal = "IEICE Transactions on Information and Systems",

issn = "0916-8532",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "3",

}

TY - JOUR

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

AU - Huh, Ji Won

AU - Isobe, Shuji

AU - Koizumi, Eisuke

AU - Shizuya, Hiroki

PY - 2013/3

Y1 - 2013/3

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

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

KW - Length-decreasing self-reduction

KW - Many-one-like reduction

KW - Partial multivalued function

UR - http://www.scopus.com/inward/record.url?scp=84878218418&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878218418&partnerID=8YFLogxK

U2 - 10.1587/transinf.E96.D.465

DO - 10.1587/transinf.E96.D.465

M3 - Article

AN - SCOPUS:84878218418

VL - E96-D

SP - 465

EP - 471

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 3

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this