19 citations · 21 across the 6 of their papers we have counts for
6 papers
Maximum Number of Steps of Topswops on 18 and 19 Cards
Kento Kimura, Atsuki Takahashi, Tetsuya Araki +1
Let be the maximum number of steps of Topswops on cards. In this note, we report our computational experiments to determine the values of and . By applyin…
Search for developments of a box having multiple ways of folding by SAT solver
Riona Tadaki, Kazuyuki Amano
A polyomino is called a development if it can make a box by folding edges of unit squares forming the polyomino. It is known that there are developments that can fold into a box (o…
Ordered Biclique Partitions and Communication Complexity Problems
Manami Shigeta, Kazuyuki Amano
An ordered biclique partition of the complete graph on vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of is covere…
A Note on the Middle Levels Conjecture
Manabu Shimada, Kazuyuki Amano
The middle levels conjecture asserts that there is a Hamiltonian cycle in the middle two levels of -dimensional hypercube. The conjecture is known to be true for …
Bounds on the Size of Small Depth Circuits for Approximating Majority
Kazuyuki Amano
In this paper, we show that for every constant and for every constant , the minimum size of a depth Boolean circuit that -approximates Majority functi…
Representation of Quantum Circuits with Clifford and Gates
Ken Matsumoto, Kazuyuki Amano
In this paper, we introduce the notion of a normal form of one qubit quantum circuits over the basis , where , and denote the Hadamard, Phase and gate…