Kazuyuki Amano
Kazuyuki Amano
Verified email at
Cited by
Cited by
Representation of quantum circuits with Clifford and gates
K Matsumoto, K Amano
arXiv preprint arXiv:0806.3834, 2008
A superpolynomial lower bound for a circuit computing the clique function with at most (1/6) log log n negation gates
K Amano, A Maruoka
SIAM Journal on Computing 35 (1), 201-216, 2005
On the complexity of depth-2 circuits with threshold gates
K Amano, A Maruoka
International Symposium on Mathematical Foundations of Computer Science, 107-118, 2005
k-Subgraph isomorphism on AC0 circuits
K Amano
Computational Complexity 19 (2), 183-210, 2010
A note on the middle levels conjecture
M Shimada, K Amano
arXiv preprint arXiv:0912.4564, 2009
Tight bounds on the average sensitivity of k-CNF
K Amano
Theory of Computing 7 (1), 45-48, 2011
Bounds on the size of small depth circuits for approximating majority
K Amano
International Colloquium on Automata, Languages, and Programming, 59-70, 2009
Potential of the approximation method
K Amano, A Maruoka
Proceedings of 37th Conference on Foundations of Computer Science, 431-440, 1996
On learning monotone Boolean functions under the uniform distribution
K Amano, A Maruoka
Theoretical Computer Science 350 (1), 3-12, 2006
On-line estimation of hidden Markov model parameters
J Mizuno, T Watanabe, K Ueki, K Amano, E Takimoto, A Maruoka
International Conference on Discovery Science, 155-169, 2000
The potential of the approximation method
K Amano, A Maruoka
SIAM Journal on Computing 33 (2), 433-447, 2004
On the number of rectangular drawings: Exact counting and lower and upper bounds
天野一幸, 中野眞一, 山中克久
情報処理学会研究報告= IPSJ SIG technical reports 2007 (119), 33-40, 2007
On the negation-limited circuit complexity of merging
K Amano, A Maruoka, J Tarui
Discrete Applied Mathematics 126 (1), 3-8, 2003
Ordered biclique partitions and communication complexity problems
M Shigeta, K Amano
Discrete Applied Mathematics 184, 248-252, 2015
Some improved bounds on communication complexity via new decomposition of cliques
K Amano
Discrete Applied Mathematics 166, 249-254, 2014
A well-mixed function with circuit complexity 5n: Tightness of the Lachish–Raz-type bounds
K Amano, J Tarui
Theoretical computer science 412 (18), 1646-1651, 2011
New upper bounds on the average PTF density of boolean functions
K Amano
International Symposium on Algorithms and Computation, 304-315, 2010
Better upper bounds on the QOBDD size of integer multiplication
K Amano, A Maruoka
Discrete Applied Mathematics 155 (10), 1224-1232, 2007
A nonuniform circuit class with multilayer of threshold gates having super quasi polynomial size lower bounds against NEXP
K Amano, A Saito
International Conference on Language and Automata Theory and Applications …, 2015
A satisfiability algorithm for some class of dense depth two threshold circuits
K Amano, A Saito
IEICE TRANSACTIONS on Information and Systems 98 (1), 108-118, 2015
The system can't perform the operation now. Try again later.
Articles 1–20