Affiliation:
1. Graduate School of Engineering, Hiroshima University
Publisher
Institute of Electronics, Information and Communications Engineers (IEICE)
Subject
Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software
Reference12 articles.
1. [1] D. Andersson, “Hashiwokakero is NP-complete,” Inf. Process. Lett., vol.109, pp.1145-1146, 2009.
2. [2] T. Asano, E.D. Demaine, M.L. Demaine, and R. Uehara, “NP-completeness of generalized Kaboozle,” J. Inf. Process., vol.20, no.3, pp.713-718, 2012.
3. [3] K. Buchin and M. Buchin, “Rolling block mazes are PSPACE-complete,” J. Inf. Process., vol.20, no.3, pp.719-722, 2012.
4. [4] M.R. Cerioli, L. Faria, T.O. Ferreira, C.A.J. Martinhon, F. Protti, and B. Reed, “Partition into cliques for cubic graphs: planar case, complexity and approximation,” Discrete Appl. Math., vol.156, no.12, pp.2270-2278, 2008.
5. [5] E.D. Demaine, M.L. Demaine, R. Uehara, T. Uno, and Y. Uno, “UNO is hard, even for a single player,” Proc. Fun with Algorithms (Lect. Notes Comput. Sci.), vol.6099, pp.133-144, 2010.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computational Complexity of Generalized Golf Solitaire;IEICE Transactions on Information and Systems;2015
2. Computational Complexity of Generalized Forty Thieves;IEICE Transactions on Information and Systems;2015