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