BlockSum is NP-complete

Kazuya Haraguchi, Hirotaka Ono

Research output: Contribution to journalArticlepeer-review

10 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 - Mar 2013

All Science Journal Classification (ASJC) codes

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

Cite this