Keyword : pencil-and-paper puzzle


NP-Completeness of Fill-a-Pix and ΣP2-Completeness of Its Fewest Clues Problem
Yuta HIGUCHI Kei KIMURA 
Publication:   
Publication Date: 2019/11/01
Vol. E102-A  No. 11 ; pp. 1490-1496
Type of Manuscript:  PAPER
Category: Algorithms and Data Structures
Keyword: 
computational complexitypencil-and-paper puzzleFill-a-PixNP-completenessΣP2-completeness
 Summary | Full Text:PDF(1.2MB)

Computational Complexity and an Integer Programming Model of Shakashaka
Erik D. DEMAINE Yoshio OKAMOTO Ryuhei UEHARA Yushi UNO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/06/01
Vol. E97-A  No. 6 ; pp. 1213-1219
Type of Manuscript:  Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: 
Keyword: 
integer programmingNP-completenesspencil-and-paper puzzleShakashaka
 Summary | Full Text:PDF(1.5MB)