Kazuyuki Amano

activity

20082021

most citedA Note on the Middle Levels Conjecture

19 citations · 21 across the 6 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2013

Ordered Biclique Partitions and Communication Complexity Problems

Manami Shigeta, Kazuyuki Amano

An ordered biclique partition of the complete graph $K_{n}$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_{n}$ is covere…

cs.CC2009★ 1 cited

Bounds on the Size of Small Depth Circuits for Approximating Majority

Kazuyuki Amano

In this paper, we show that for every constant $0 < ε < 1/2$ and for every constant $d \geq 2$ , the minimum size of a depth $d$ Boolean circuit that $ε$ -approximates Majority functi…