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은 Nikoli의 연필 퍼즐 중 하나입니다. 우리는 Usowan 퍼즐의 계산 복잡성을 연구합니다. Usowan 퍼즐의 주어진 인스턴스에 해결책이 있는지 여부를 결정하는 것은 NP-완전인 것으로 나타났습니다.
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.
부
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
부
@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},}
부
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 -