2008 - 2010 Practical approach to self-constructive learning on subjects on computer science
2007 - 2008 Development of a New Method for Circuit Complexity Based on Large Scale Mathematical Programs
2005 - 2007 生体情報処理における深層計算と表層計算に関する研究
2004 - 2007 オンライン予測の手法を用いた意思決定モデルに関する研究
2005 - 2006 論理関数の複雑さの下限導出問題に対する極限組み合わせ論的アプローチ
2003 - 2005 Computational principal on how parts and wholes cooperate and conflict
2003 - 2004 論理関数の近似計算と厳密計算の困難さのギャップに関する研究
2001 - 2002 On-line learning algorithm for organizing data based on generalized entropy
1999 - 2000 近似法に基づく論理関数の複雑さの評価に関する研究
1999 - 1999 ブースティング技術を用いた知識発見アルゴリズムに関する研究
1997 - 1998 近似法による計算の複雑さの評価に関する研究
Show all
Papers (70):
Kento Kimura, Kazuyuki Amano, Shin-ichi Nakano. Escape from the Room. Lecture Notes in Computer Science. 2022. 232-241
Kento KIMURA, Kazuyuki AMANO, Tetsuya ARAKI. On the Minimum Number of Pieces for Two-Dimensional Anti-Slide Using T-Tetrominoes. IEICE Transactions on Information and Systems. 2021. E104.D. 3. 355-361
Kazuyuki Amano,Yoshinobu Haruyama. On the Number of p4-tilings by an N-omino. International Journal of Computational Geometry and Applications. 2019. 29. 1. 3-19
Kazuyuki Amano,Shoma Tate. On XOR Lemmas for the Weight of Polynomial Threshold Functions. Information and Computation. 2019. online
Kazuyuki Amano, Yoshinobu Haruyama. On the number of p4-Tilings by an n-Omino. Leibniz International Proceedings in Informatics, LIPIcs. 2017. 92. 5:1-5:12
Amano\, Kazuyuki. On XOR Lemma for Polynomial Threshold Weight and Length. Lecture Notes in Computer Science. 2016. 9618. 259-269
Amano\, Kazuyuki. On XOR Lemma for Polynomial Threshold Weight and Length. Lecture Notes in Computer Science. 2016. 9618. 259-269
Kazuyuki Amano,Kyaw May Oo,Yota Otachi,Ryuhei Uehara. Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS. 2015. E98D. 3. 486-489