Computational Complexity of Puzzles and Related Topics-Reference-Cited by-同舟云学术

Computational Complexity of Puzzles and Related Topics

Published:2023 Issue: Volume: Page:
ISSN:1340-9050
Container-title:Interdisciplinary Information Sciences
language:en
Short-container-title:IIS

Author:

UEHARA Ryuhei¹

Affiliation:

1. School of Information Science, Japan Advanced Institute of Science and Technology

Publisher

Graduate School of Information Sciences, Tohoku University

Subject

General Medicine

Link

https://www.jstage.jst.go.jp/article/iis/advpub/0/advpub_2022.R.06/_pdf

Reference112 articles.

1. [1] Adcock, A., Demaine, E. D., Demaine, M. L., O'Brien, M. P., Reidl, F., Villaamil, F. S., and Sullivan, B. D., "Zig-zag numberlink is NP-complete," Journal of Information Processing, 23(3): 239–245 (2015). DOI:10.2197/ipsjjip.23.239.

2. [2] Adler, A., Bosboom, J., Demaine, E. D., Demaine, M. L., Liu, Q. C., and Lynch, J., "Tatamibari is NP-complete," Proc. 10th International Conference on Fun with Algorithms, 1–24, LIPICS, Vol. 157, Dagstuhl (2021). DOI:10.4230/LIPIcs.FUN.2021.1.

3. [3] Allen, A., and Williams, A., "Sto-stone is NP-complete," Proc. 30th Canadian Conference on Computational Geometry, 28–34 (2018).

4. [4] Andersson, D., "HIROIMONO is NP-complete," Proc. 4th International Conference on Fun with Algorithms, 30–39. Lecture Notes in Computer Science, Vol. 4475, Springer-Verlag (2007).

5. [5] Andersson, D., "Hashiwokakero is NP-complete," Information and Processing Letters, 109: 1145–1146 (2009). DOI:10.1016/j.ipl.2009.07.017.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Computational Complexity of Generalized Common Shape Puzzles;Lecture Notes in Computer Science;2024

2. Solving Reconfiguration Problems of First-Order Expressible Properties of Graph Vertices with Boolean Satisfiability;2023 IEEE 35th International Conference on Tools with Artificial Intelligence (ICTAI);2023-11-06

3. Optimal Arrangement and Rearrangement of Objects on Shelves to Minimize Robot Retrieval Cost;IEEE Transactions on Automation Science and Engineering;2023