BlockSum is NP-complete

Kazuya Haraguchi, Hirotaka Ono

Research output: Contribution to journalArticle

9 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)481-488
Number of pages8
JournalIEICE Transactions on Information and Systems
VolumeE96-D
Issue number3
DOIs
Publication statusPublished - Jan 1 2013

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

BlockSum is NP-complete. / Haraguchi, Kazuya; Ono, Hirotaka.

In: IEICE Transactions on Information and Systems, Vol. E96-D, No. 3, 01.01.2013, p. 481-488.

Research output: Contribution to journalArticle

Haraguchi, Kazuya ; Ono, Hirotaka. / BlockSum is NP-complete. In: IEICE Transactions on Information and Systems. 2013 ; Vol. E96-D, No. 3. pp. 481-488.
@article{844fa464caed47328e04bc9a74460fac,
title = "BlockSum is NP-complete",
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.",
author = "Kazuya Haraguchi and Hirotaka Ono",
year = "2013",
month = "1",
day = "1",
doi = "10.1587/transinf.E96.D.481",
language = "English",
volume = "E96-D",
pages = "481--488",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "3",

}

TY - JOUR

T1 - BlockSum is NP-complete

AU - Haraguchi, Kazuya

AU - Ono, Hirotaka

PY - 2013/1/1

Y1 - 2013/1/1

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

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.

UR - http://www.scopus.com/inward/record.url?scp=84878249750&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84878249750&partnerID=8YFLogxK

U2 - 10.1587/transinf.E96.D.481

DO - 10.1587/transinf.E96.D.481

M3 - Article

VL - E96-D

SP - 481

EP - 488

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 3

ER -