IEICE TRANSACTIONS on Information
Autoreducibility and Completeness for Partial Multivalued Functions
Summary :
In this paper, we investigate a relationship between many-one-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 many-one complete function for these classes is strict metric many-one autoreducible.
- Publication
- IEICE TRANSACTIONS on Information Vol.E100-D No.3 pp.422-427
- Publication Date
- 2017/03/01
- Publicized
- 2016/12/21
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2016FCP0006
- Type of Manuscript
- Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Theoretical Computer Science —)
- Category
Authors
Shuji ISOBE
Tohoku University
Eisuke KOIZUMI
Tohoku University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shuji ISOBE, Eisuke KOIZUMI, "Autoreducibility and Completeness for Partial Multivalued Functions" in IEICE TRANSACTIONS on Information,
vol. E100-D, no. 3, pp. 422-427, March 2017, doi: 10.1587/transinf.2016FCP0006.
Abstract: In this paper, we investigate a relationship between many-one-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 many-one complete function for these classes is strict metric many-one autoreducible.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016FCP0006/_p
Copy
@ARTICLE{e100-d_3_422,
author={Shuji ISOBE, Eisuke KOIZUMI, },
journal={IEICE TRANSACTIONS on Information},
title={Autoreducibility and Completeness for Partial Multivalued Functions},
year={2017},
volume={E100-D},
number={3},
pages={422-427},
abstract={In this paper, we investigate a relationship between many-one-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 many-one complete function for these classes is strict metric many-one autoreducible.},
keywords={},
doi={10.1587/transinf.2016FCP0006},
ISSN={1745-1361},
month={March},}
Copy
TY - JOUR
TI - Autoreducibility and Completeness for Partial Multivalued Functions
T2 - IEICE TRANSACTIONS on Information
SP - 422
EP - 427
AU - Shuji ISOBE
AU - Eisuke KOIZUMI
PY - 2017
DO - 10.1587/transinf.2016FCP0006
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E100-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2017
AB - In this paper, we investigate a relationship between many-one-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 many-one complete function for these classes is strict metric many-one autoreducible.
ER -
English
