IEICE TRANSACTIONS on Information
BLOCKSUM is NP-Complete
Summary :
BLOCKSUM, also known as KEISANBLOCK in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BLOCKSUM has a solution or not is NP-complete.
- Publication
- IEICE TRANSACTIONS on Information Vol.E96-D No.3 pp.481-488
- Publication Date
- 2013/03/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E96.D.481
- Type of Manuscript
- Special Section PAPER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —)
- Category
Authors
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
Kazuya HARAGUCHI, Hirotaka ONO, "BLOCKSUM is NP-Complete" in IEICE TRANSACTIONS on Information,
vol. E96-D, no. 3, pp. 481-488, March 2013, doi: 10.1587/transinf.E96.D.481.
Abstract: BLOCKSUM, also known as KEISANBLOCK in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BLOCKSUM has a solution or not is NP-complete.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E96.D.481/_p
Copy
@ARTICLE{e96-d_3_481,
author={Kazuya HARAGUCHI, Hirotaka ONO, },
journal={IEICE TRANSACTIONS on Information},
title={BLOCKSUM is NP-Complete},
year={2013},
volume={E96-D},
number={3},
pages={481-488},
abstract={BLOCKSUM, also known as KEISANBLOCK in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BLOCKSUM has a solution or not is NP-complete.},
keywords={},
doi={10.1587/transinf.E96.D.481},
ISSN={1745-1361},
month={March},}
Copy
TY - JOUR
TI - BLOCKSUM is NP-Complete
T2 - IEICE TRANSACTIONS on Information
SP - 481
EP - 488
AU - Kazuya HARAGUCHI
AU - Hirotaka ONO
PY - 2013
DO - 10.1587/transinf.E96.D.481
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2013
AB - BLOCKSUM, also known as KEISANBLOCK in Japanese, is a Latin square filling type puzzle, such as Sudoku. In this paper, we prove that the decision problem whether a given instance of BLOCKSUM has a solution or not is NP-complete.
ER -
English
