IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —
BlockSum is NP-Complete
Kazuya HARAGUCHIHirotaka ONO
Author information
JOURNALS FREE ACCESS

2013 Volume E96.D Issue 3 Pages 481-488

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

Information related to the author
© 2013 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top