2013年3月
BLOCKSUM is NP-Complete
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- ,
- 巻
- E96D
- 号
- 3
- 開始ページ
- 481
- 終了ページ
- 488
- 記述言語
- 英語
- 掲載種別
- 研究論文（学術雑誌）
- DOI
- 10.1587/transinf.E96.D.481
- 出版者・発行元
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
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.
- リンク情報
-
- DOI
- https://doi.org/10.1587/transinf.E96.D.481
- DBLP
- https://dblp.uni-trier.de/rec/journals/ieicet/HaraguchiO13
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000320214300012&DestApp=WOS_CPL
- URL
- http://search.ieice.org/bin/summary.php?id=e96-d_3_481
- URL
- http://dblp.uni-trier.de/db/journals/ieicet/ieicet96d.html#journals/ieicet/HaraguchiO13
- ID情報
-
- DOI : 10.1587/transinf.E96.D.481
- ISSN : 0916-8532
- DBLP ID : journals/ieicet/HaraguchiO13
- Web of Science ID : WOS:000320214300012