31 citations · 41 across the 13 of their papers we have counts for
14 papers
Computational Complexity of Swish
Takashi Horiyama, Takehiro Ito, Jun Kawahara +4
Swish is a card game in which players are given cards having symbols (hoops and balls), and find a valid superposition of cards, called a "swish." Dailly, Lafourcade, and Marcadet…
On the sizes of BDDs and ZDDs representing matroids
Hiromi Emoto, Yuni Iwamasa, Shin-ichi Minato
Matroids are often represented as oracles since there are no unified and compact representations for general matroids. This paper initiates the study of binary decision diagrams (B…
International Competition on Graph Counting Algorithms 2023
Takeru Inoue, Norihito Yasuda, Hidetomo Nabeshima +3
This paper reports on the details of the International Competition on Graph Counting Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs satisfyin…
On the Computational Complexity of Generalized Common Shape Puzzles
Mutsunori Banbara, Shin-ichi Minato, Hirotaka Ono +1
In this study, we investigate the computational complexity of some variants of generalized puzzles. We are provided with two sets S_1 and S_2 of polyominoes. The first puzzle asks…
Sorting Balls and Water: Equivalence and Computational Complexity
Takehiro Ito, Jun Kawahara, Shin-ichi Minato +7
Various forms of sorting problems have been studied over the years. Recently, two kinds of sorting puzzle apps are popularized. In these puzzles, we are given a set of bins filled…
Interval-Memoized Backtracking on ZDDs for Fast Enumeration of All Lower Cost Solutions
Shin-ichi Minato, Mutsunori Banbara, Takashi Horiyama +3
In this paper, we propose a fast method for exactly enumerating a very large number of all lower cost solutions for various combinatorial problems. Our method is based on backtrack…