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
Reference10 articles.
1. [1] 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.
2. [2] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.
3. [3] K. Haraguchi and H. Ono, “ BlockSum is NP-complete,” IEICE Trans. Inf. & Syst., vol.E96-D, no.3, pp.481-488, March 2013.
4. [4] R.A. Hearn and E.D. Demaine, Games, Puzzles, and Computation, A K Peters Ltd., 2009.
5. [5] R. Houston, J. White, and M. Amos, “Zen puzzle garden is NP-complete,” Inf. Process. Lett., vol.112, pp.106-108, 2012.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computational Complexity of Building Puzzles;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2016