|
| Keyword : NP-complete
| |
| |
| |
|
Choco Banana is NP-Complete
Chuzo IWAMOTO Takeru TOKUNAGA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2024/09/01
Vol. E107-A
No. 9 ;
pp. 1488-1491
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category: Algorithms and Data Structures
Keyword:
Choco Banana, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
|
Chained Block is NP-Complete
Chuzo IWAMOTO Tatsuya IDE | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2024/03/01
Vol. E107-D
No. 3 ;
pp. 320-324
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science — Foundations of Computer Science and their New Trends —)
Category:
Keyword:
chained Block, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
|
Calculation Solitaire is NP-Complete
Chuzo IWAMOTO Tatsuya IDE | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2023/03/01
Vol. E106-D
No. 3 ;
pp. 328-332
Type of Manuscript:
Special Section LETTER (Special Section on Foundations of Computer Science — Foundations of Computer Science Supporting the Information Society —)
Category:
Keyword:
calculation solitaire, card game, NP-complete, | | | Summary | Full Text:PDF | |
|
Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete
Chuzo IWAMOTO Tatsuya IDE | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2022/09/01
Vol. E105-A
No. 9 ;
pp. 1187-1194
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: Algorithms and Data Structures
Keyword:
Moon-or-Sun, Nagareru, Nurimeizu, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
|
Five Cells and Tilepaint are NP-Complete
Chuzo IWAMOTO Tatsuya IDE | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2022/03/01
Vol. E105-D
No. 3 ;
pp. 508-516
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science - New Trends of Theory of Computation and Algorithm -)
Category:
Keyword:
Five Cells, Tilepaint, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
|
Computational Complexity of Nurimisaki and Sashigane
Chuzo IWAMOTO Tatsuya IDE | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2020/10/01
Vol. E103-A
No. 10 ;
pp. 1183-1192
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: complexity theory
Keyword:
Nurimisaki, Sashigane, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
|
Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles
Chuzo IWAMOTO Tatsuaki IBUSUKI | Publication: IEICE TRANSACTIONS on Information and Systems
Publication Date: 2020/03/01
Vol. E103-D
No. 3 ;
pp. 500-505
Type of Manuscript:
Special Section PAPER (Special Section on Foundations of Computer Science — Frontiers of Theory of Computation and Algorithm —)
Category:
Keyword:
Kurotto, Juosan, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
|
Computational Complexity of Herugolf and Makaro
Chuzo IWAMOTO Masato HARUISHI Tatsuaki IBUSUKI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2019/09/01
Vol. E102-A
No. 9 ;
pp. 1118-1125
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category: Puzzles
Keyword:
Herugolf, Makaro, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
|
Computational Complexity of Usowan Puzzles
Chuzo IWAMOTO Masato HARUISHI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2018/09/01
Vol. E101-A
No. 9 ;
pp. 1537-1540
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
Usowan, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
| |
|
Computational Complexity of Building Puzzles
Chuzo IWAMOTO Yuta MATSUI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/06/01
Vol. E99-A
No. 6 ;
pp. 1145-1148
Type of Manuscript:
Special Section LETTER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
building puzzle, pencil puzzle, NP-complete, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
Complexity and Completeness of Finding Another Solution and Its Application to Puzzles
Takayuki YATO Takahiro SETA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2003/05/01
Vol. E86-A
No. 5 ;
pp. 1052-1060
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
computational complexity, NP-complete, another solution, puzzle, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
A Linear-Time Algorithm for Determining the Order of Moving Products in Realloction Problems
Hiroyoshi MIWA Hiro ITO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/03/25
Vol. E80-A
No. 3 ;
pp. 534-543
Type of Manuscript:
Special Section PAPER (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
Category:
Keyword:
graph, reallocation, linear-time, NP-complete, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
|
Complexity and Algorithm for Reallocation Problem
Hiroyoshi MIWA Hiro ITO | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/04/25
Vol. E79-A
No. 4 ;
pp. 461-468
Type of Manuscript:
Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
Category:
Keyword:
reallocation, graph, linear time, NP-complete, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
|
A Polynomial Time Algorithm for Finding a Largest Common Subgraph of almost Trees of Bounded Degree
Tatsuya AKUTSU | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1993/09/25
Vol. E76-A
No. 9 ;
pp. 1488-1493
Type of Manuscript:
PAPER
Category: Algorithms, Data Structures and Computational Complexity
Keyword:
largest common subgraph, subgraph isomorphism, almost trees, NP-complete, | | | Summary | Full Text:PDF | |
|
|