The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Usowan adalah salah satu teka-teki pensel Nikoli. Kami mengkaji kerumitan pengiraan teka-teki Usowan. Ia ditunjukkan bahawa memutuskan sama ada contoh teka-teki Usowan yang diberikan mempunyai penyelesaian adalah NP-lengkap.
Chuzo IWAMOTO
Hiroshima University
Masato HARUISHI
Hiroshima University
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.
Salinan
Chuzo IWAMOTO, Masato HARUISHI, "Computational Complexity of Usowan Puzzles" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 9, pp. 1537-1540, September 2018, doi: 10.1587/transfun.E101.A.1537.
Abstract: Usowan is one of Nikoli's pencil puzzles. We study the computational complexity of Usowan puzzles. It is shown that deciding whether a given instance of the Usowan puzzle has a solution is NP-complete.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1537/_p
Salinan
@ARTICLE{e101-a_9_1537,
author={Chuzo IWAMOTO, Masato HARUISHI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computational Complexity of Usowan Puzzles},
year={2018},
volume={E101-A},
number={9},
pages={1537-1540},
abstract={Usowan is one of Nikoli's pencil puzzles. We study the computational complexity of Usowan puzzles. It is shown that deciding whether a given instance of the Usowan puzzle has a solution is NP-complete.},
keywords={},
doi={10.1587/transfun.E101.A.1537},
ISSN={1745-1337},
month={September},}
Salinan
TY - JOUR
TI - Computational Complexity of Usowan Puzzles
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1537
EP - 1540
AU - Chuzo IWAMOTO
AU - Masato HARUISHI
PY - 2018
DO - 10.1587/transfun.E101.A.1537
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2018
AB - Usowan is one of Nikoli's pencil puzzles. We study the computational complexity of Usowan puzzles. It is shown that deciding whether a given instance of the Usowan puzzle has a solution is NP-complete.
ER -