Amano Kazuyuki 天野一幸

… Alternative Names

AMANO Kazuyuki 天野一幸

Less

Researcher Number	30282031
Other IDs
External Links
Affiliation (Current)	2025: 群馬大学, 情報学部, 教授
Affiliation (based on the past Project Information) *help	2025: 群馬大学, 情報学部, 教授 2021 – 2023: 群馬大学, 情報学部, 教授 2014 – 2020: 群馬大学, 大学院理工学府, 教授 2014 – 2016: 群馬大学, その他部局等, 教授 2013: 群馬大学, 理工学研究科, 教授 … More 2013: 群馬大学, 理工学研究院, 教授 2012: 群馬大学, 工学(系)研究科(研究院), 教授 2007 – 2011: Gunma University, 大学院・工学研究科, 准教授 2007: 群馬大学, 工学部, 准教授 2006: 群馬大学, 大学院工学研究科, 准教授 2005 – 2006: 群馬大学, 工学部, 助教授 2005: 東北大学, 大学院情報科学研究科, 助手 1997 – 2005: 東北大学, 大学院・情報科学研究科, 助手 1999: 東北大学, 大学院・情報科学研究所, 助手 Less
Review Section/Research Field	Principal Investigator Fundamental theory of informatics / Basic Section 60010:Theory of informatics-related / 計算機科学 / Medium-sized Section 60:Information science, computer engineering, and related fields / Theory of informatics Except Principal Investigator Fundamental theory of informatics / Medium-sized Section 60:Information science, computer engineering, and related fields / 計算機科学 / Science and Engineering / Science education / Science and Engineering
Keywords	Principal Investigator 下界 / 論理関数 / 論理回路 / 計算量理論 / 計算量 / 計算複雑さ / しきい値回路 / 回路計算量 / 離散構造 / 充足可能性問題 … More / 整数複雑さ / 計算機援用 / P vs. NP問題 / 多数決関数 / 計算複雑性理論 / P≠NP予想 / 整数計画 / しきい値論理回路 / 計算複雑性 / 数理計画 / 計算機援用証明 / 決定木 / 複雑さ / 否定素子数限定回路 / 近似法 / 単調 / コラッツ予想 / 閾値回路 / 実験数学 / 多項式しきい値関数 / 多項式しきい値表現 / 離散数学 / グラフ / 完全グラフ / 充足可能性 / 線形計画 / 二部グラフ被覆 / 通信計算量 / 計算困難性 / 量子回路 / 下限 / 二分決定グラフ / 線形計画法 / クリーク関数 / マージング / 否定素子数限定論理回路 / 比較交換器回路 / 単調論理回路 / 並列計算 / 剰余回路 / オンラインアルゴリズム / 隠れマルコフモデル / Baum-Welch法 / 知識発見 / ブースティング … More Except Principal Investigator しきい値回路 / ブースティング / ランダムプロジェクション / boosting / 過学習 / 例題からの学習 / 学習曲線 / 論理回路 / 計算学習理論 / 回路計算量 / オンラインオークション / オンラインアルゴリズム / 量子計算の基礎 / SAT問題 / 質問計算量 / 最小回路サイズ問題 / 情報セキュリティ技術 / 情報セキュリティ / 学習可能性 / 平均時計算量 / Ｐ≠ＮＰ予想 / 機械学習 / PAC学習困難性 / 計算論的暗号 / 平均時計算困難性 / 多項式時間階層 / 最小記述量計算 / 一方向関数 / 学習計算困難さ / 平均時計算複雑度 / 最小記述量 / 計算論的暗号理論 / 計算論的学習理論 / 平均時時間計算量 / 最悪時時間計算量 / メタ計算 / P≠NP予想 / 最小記述量計算問題 / 計算複雑度理論 / majority function / correlation / clique function / random projection / on line allocation / risk information / decision tree / 協調と競合 / 境界被覆 / 学習アルゴリズム / NP完全問題 / 論理回路の下界 / 非単調論理回路 / 単調論理回路 / エネルギー計算量 / ブーステイング / 学習 / マージン保存 / シャノンスイッチングゲーム / 単調DNF式 / 決定リスト / Vovkの統合戦略 / 動的資源配分 / 多数決関数 / 相関 / クリーク関数 / オンライン割り当て / リスク情報 / 決定木 / over-fitting / learning curve / generalized entropy / decision tree boosting / prunning / on-line learning algorithm / learning from examples / m-限定独立 / 次元圧縮 / 勾配傾斜法 / サポートベクトルマシーン / マージン / 汎化エントロピー / 決定木ブースティング / プルーニング / オンライン学習アルゴリズム / 国際研究者交流（ベルギー・ドイツ） / 国際研究者交流:カナダ・ベルギー・チェコ・ドイツ / 多面体 / 国際研究者交流 / 計算限界 / 整数計画 / 線形計画 / 数理計画 / 国際研究者交流:カナダ・チェコ・米国 / 最適化数 / 数理計画法への応用 / 最適化 / 幾何計算 / カードゲーム / 情報系教科 / 計算理論 / 認知心理学 / 脳科学 / 自然科学教育(数学、情報) / 深層計算 / 表層計算 / 単調論理関数 / 決定二分グラフ / 線形計画問題 / ニューラルネットワーク / 2次論理関数 / ソート / 単調回路量 / 論理関数 / オークション / kトニック2進系列 / 順序付きダイアグラム / オンラインアロケーション / 統合戦略 / 計算量 / 下界 / 検索エンジン / 最長共通部分列問題 / 否定数限定複雑さ / 多階層関係追加モデル / 最長共通増加部分列問題 / 読捨てコンテンツ更新問題 / オンライン予測 / 描画列挙 / フーリエ解析 / エネルギー複雑度 / 閾値回路 / 最長共通部分配列問題 / 表現の複雑さ Less

計算理論と数学の交差点：計算複雑性理論によるメタ解析Principal Investigator
- Principal Investigator
  
  天野一幸
- Project Period (FY)
  2025 – 2028
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Gunma University
「計算」の視点から見る数学的難問Principal Investigator
- Principal Investigator
  
  天野一幸
- Project Period (FY)
  2021 – 2024
- Research Category
  
  Grant-in-Aid for Challenging Research (Exploratory)
- Review Section
  
  Medium-sized Section 60:Information science, computer engineering, and related fields
- Research Institution
  Gunma University
Experimental Computational Complexity Theory - Its Establishment and DevelopmentPrincipal Investigator
- Principal Investigator
  
  Amano Kazuyuki
- Project Period (FY)
  2018 – 2023
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Review Section
  
  Basic Section 60010:Theory of informatics-related
- Research Institution
  Gunma University
Computational Complexity of Minimum Description Size Problems
- Principal Investigator
  
  Watanabe Osamu
- Project Period (FY)
  2018 – 2021
- Research Category
  
  Grant-in-Aid for Scientific Research (A)
- Review Section
  
  Medium-sized Section 60:Information science, computer engineering, and related fields
- Research Institution
  Tokyo Institute of Technology
Extending NP-Hardness via the development of computational Ramsey TheoryPrincipal Investigator
- Principal Investigator
  
  Amano Kazuyuki
- Project Period (FY)
  2015 – 2018
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Theory of informatics
- Research Institution
  Gunma University
Analyzing the limits of computation using large scale linear programming
- Principal Investigator
  
  Avis David
- Project Period (FY)
  2012 – 2016
- Research Category
  
  Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
- Review Section
  
  Science and Engineering
- Research Institution
  Kyoto University
Developing computer-assisted methods for proving computational intractabilityPrincipal Investigator
- Principal Investigator
  
  Kazuyuki Amano
- Project Period (FY)
  2012 – 2015
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Gunma University
Establishing Computer Assisted Proof Methods for Computational IntractabilityPrincipal Investigator
- Principal Investigator
  
  AMANO Kazuyuki
- Project Period (FY)
  2009 – 2011
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Gunma University
Practical approach to self-constructive learning on subjects on computer science
- Principal Investigator
  
  MARUOKA Akira
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Science education
- Research Institution
  Ishinomaki Senshu University
Development of a New Method for Circuit Complexity Based on Large Scale Mathematical ProgramsPrincipal Investigator
- Principal Investigator
  
  AMANO Kazuyuki
- Project Period (FY)
  2007 – 2008
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Gunma University
生体情報処理における深層計算と表層計算に関する研究
- Principal Investigator
  
  MARUOKA Akira
- Project Period (FY)
  2005 – 2007
- Research Category
  
  Grant-in-Aid for Exploratory Research
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Ishinomaki Senshu University
  Tohoku University
論理関数の複雑さの下限導出問題に対する極限組み合わせ論的アプローチPrincipal Investigator
- Principal Investigator
  
  天野一幸
- Project Period (FY)
  2005 – 2006
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Gunma University
  Tohoku University
オンライン予測の手法を用いた意思決定モデルに関する研究
- Principal Investigator
  
  TAKIMOTO Eiji
- Project Period (FY)
  2004 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas
- Review Section
  
  Science and Engineering
- Research Institution
  Tohoku University
論理関数の近似計算と厳密計算の困難さのギャップに関する研究Principal Investigator
- Principal Investigator
  
  天野一幸
- Project Period (FY)
  2003 – 2004
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Tohoku University
Computational principal on how parts and wholes cooperate and conflict
- Principal Investigator
  
  MARUOKA Akira
- Project Period (FY)
  2003 – 2005
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Tohoku University
On-line learning algorithm for organizing data based on generalized entropy
- Principal Investigator
  
  MARUOKA Akira
- Project Period (FY)
  2001 – 2002
- Research Category
  
  Grant-in-Aid for Scientific Research (B)
- Research Field
  
  計算機科学
- Research Institution
  Tohoku University
ブースティング技術を用いた知識発見アルゴリズムに関する研究Principal Investigator
- Principal Investigator
  
  天野一幸
- Project Period (FY)
  1999
- Research Category
  
  Grant-in-Aid for Scientific Research on Priority Areas (A)
- Research Institution
  Tohoku University
近似法に基づく論理関数の複雑さの評価に関する研究Principal Investigator
- Principal Investigator
  
  天野一幸
- Project Period (FY)
  1999 – 2000
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  Tohoku University
近似法による計算の複雑さの評価に関する研究Principal Investigator
- Principal Investigator
  
  天野一幸
- Project Period (FY)
  1997 – 1998
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  Tohoku University

[Journal Article] Depth-Three Circuits for Inner Product and Majority Functions,2023
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Leibniz International Proceedings in Informatics (LIPIcs), Proc. of ISAAC 2023
  
  Volume: 283
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11152
[Journal Article] Depth-Three Circuits for Inner Product and Majority Functions2023
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Leibniz International Proceedings in Informatics (LIPIcs), Proc. of ISAAC 2023
  
  Volume: 283
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-21K19758
[Journal Article] Lower Bounds on the PTF Weight of ODD-MAXBIT Function2023
- Author(s)
  AMANO Kazuyuki
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E106.A Issue: 9 Pages: 1189-1190
- DOI
  10.1587/transfun.2022DML0003
- ISSN
  0916-8508, 1745-1337
- Year and Date
  2023-09-01
- Language
  English
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-21K19758, KAKENHI-PROJECT-18K11152
[Journal Article] Integer Complexity and Mixed Binary-Ternary Representation2022
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Proceedings of ISAAC 2022, LIPIcs
  
  Volume: 248
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11152
[Journal Article] Integer Complexity and Mixed Binary-Ternary Representation2022
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Proceedings of ISAAC 2022, LIPIcs
  
  Volume: 248
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-21K19758
[Journal Article] Escape from the Room2022
- Author(s)
  Kimura Kento、Amano Kazuyuki、Nakano Shin-ichi
- Journal Title
  
  Proceedings of COCOON 2022, LNCS
  
  Volume: 13595 Pages: 232-241
- DOI
  10.1007/978-3-031-22105-7_21
- ISBN
  9783031221040, 9783031221057
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11152, KAKENHI-PROJECT-21K19758
[Journal Article] On the Minimum Number of Pieces for Two-Dimensional Anti-Slide Using T-Tetrominoes2021
- Author(s)
  KIMURA Kento、AMANO Kazuyuki、ARAKI Tetsuya
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E104.D Issue: 3 Pages: 355-361
- DOI
  10.1587/transinf.2020FCP0007
- NAID
  130007993186
- ISSN
  0916-8532, 1745-1361
- Year and Date
  2021-03-01
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11152, KAKENHI-PROJECT-18H04090
[Journal Article] On the Size of Depth-Two Threshold Circuit for Inner Product Mod 2 Function2020
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  LNCS (Proc. of 14th Int. Conf. on Language and Automata Theory, LATA 2020)
  
  Volume: 12038 Pages: 235-247
- DOI
  10.1007/978-3-030-40608-0_16
- ISBN
  9783030406073, 9783030406080
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11152, KAKENHI-PROJECT-18H04090
[Journal Article] An Approximation Algorithm for the 2-Dispersion Problem2020
- Author(s)
  Kazuyuki Amano and Shin-ichi Nakano
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E103.D Issue: 3 Pages: 506-508
- DOI
  10.1587/transinf.2019FCP0005
- NAID
  130007804167
- ISSN
  0916-8532, 1745-1361
- Year and Date
  2020-03-01
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11152, KAKENHI-PROJECT-18H04090, KAKENHI-PROJECT-17K00003
[Journal Article] On the Number of p4-tilings by an N-omino2019
- Author(s)
  Kazuyuki Amano and Yoshinobu Haruyama
- Journal Title
  
  International Journal of Computational Geometry and Applications (IJCGA)
  
  Volume: 29-1 Issue: 01 Pages: 3-19
- DOI
  10.1142/s0218195919400016
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11152, KAKENHI-PROJECT-18H04090
[Journal Article] On XOR Lemmas for the Weight of Polynomial Threshold Functions2019
- Author(s)
  Kazuyuki Amano and Shoma Tate
- Journal Title
  
  Information and Computation
  
  Volume: 269 Pages: 104439-104439
- DOI
  10.1016/j.ic.2019.104439
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11152, KAKENHI-PROJECT-18H04090
[Journal Article] Depth Two (<i>n</i>-2)-Majority Circuits for <i>n</i>-Majority2018
- Author(s)
  Kazuyuki Amano and Masafumi Yoshida
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: E101.A Issue: 9 Pages: 1543-1545
- DOI
  10.1587/transfun.E101.A.1543
- NAID
  130007479524
- ISSN
  0916-8508, 1745-1337
- Year and Date
  2018-09-01
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18K11152, KAKENHI-PROJECT-18H04090, KAKENHI-PROJECT-15K00006
[Journal Article] Depth Two Majority Circuits for Majority and List Expanders2018
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  LIPIcs (Leibniz International Proceedings in Informatics)
  
  Volume: 117
- DOI
  10.4230/LIPICS.MFCS.2018.81
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-18K11152, KAKENHI-PROJECT-15K00006
[Journal Article] On the Number of p4-tilings by an n-Omino2017
- Author(s)
  Kazuyuki Amano and Yoshinobu Haruyama
- Journal Title
  
  Leibniz International Proceedings in Informatics (LIPIcs)
  
  Volume: 92
- DOI
  10.4230/LIPIcs.ISAAC.2017.5
- Peer Reviewed / Open Access
- Data Source
  KAKENHI-PROJECT-15K00006
[Journal Article] Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy2017
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Information Theory (ISIT), 2017 IEEE International Symposium on
  
  Volume: - Pages: 251-255
- DOI
  10.1109/isit.2017.8006528
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-15K00006
[Journal Article] On XOR Lemma for Polynomial Threshold Weight and Length2016
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 9618 Pages: 259-269
- DOI
  10.1007/978-3-319-30000-9_20
- ISBN
  9783319299990, 9783319300009
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-15K00006, KAKENHI-PLANNED-24106006, KAKENHI-PROJECT-24500006
[Journal Article] A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits2015
- Author(s)
  Kazuyuki Amano and Atsushi Saito
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E98.D Issue: 1 Pages: 108-118
- DOI
  10.1587/transinf.2014EDP7127
- NAID
  130004721744
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500006
[Journal Article] Anti-Slide2015
- Author(s)
  Kazuyuki Amano, Shin-ichi Nakano and Koichi Yamazaki
- Journal Title
  
  Journal of Information Processing
  
  Volume: 印刷中
- NAID
  130005070060
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-24500006
[Journal Article] Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds2015
- Author(s)
  Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara
- Journal Title
  
  IEICE Trans. Inf. & Syst.
  
  Volume: E98.D Issue: 3 Pages: 486-489
- DOI
  10.1587/transinf.2014FCP0007
- NAID
  130004841873
- ISSN
  0916-8532, 1745-1361
- Language
  English
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106004, KAKENHI-PROJECT-24500006, KAKENHI-PROJECT-25730003, KAKENHI-PROJECT-26330009
[Journal Article] Anti-Slide2015
- Author(s)
  Kazuyuki Amano, Shin-ichi Nakano and Koichi Yamazaki
- Journal Title
  
  Journal of Information Processing
  
  Volume: 23 Issue: 3 Pages: 252-257
- DOI
  10.2197/ipsjjip.23.252
- NAID
  130005070060
- ISSN
  1882-6652
- Language
  English
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PLANNED-24106006
[Journal Article] Ordered Biclique Partitions and Communication Complexity Problems2015
- Author(s)
  Manami Shigeta and Kazuyuki Amano
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 184 Pages: 248-252
- DOI
  10.1016/j.dam.2014.10.029
- Peer Reviewed / Acknowledgement Compliant
- Data Source
  KAKENHI-PROJECT-24500006
[Journal Article] A Nonuniform Circuit Class with Multilayer of Threshold Gates having Super Quasi Polynomial Size Lower Bounds against NEXP2015
- Author(s)
  Kazuyuki Amano and Atsushi Saito
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 8977 Pages: 461-472
- DOI
  10.1007/978-3-319-15579-1_36
- ISBN
  9783319155784, 9783319155791
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500006
[Journal Article] Some Improved Bounds on Communication Complexity via New Decomposition of Cliques2014
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Discrete Applied Mathematics
  
  Volume: 166 Pages: 249-254
- DOI
  10.1016/j.dam.2013.09.015
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106006, KAKENHI-PROJECT-24500006
[Journal Article] On Extremal k-CNF Formulas2014
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  European Journal of Combinatorics
  
  Volume: 35 Pages: 39-50
- DOI
  10.1016/j.ejc.2013.06.011
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106006, KAKENHI-PROJECT-24500006
[Journal Article] On Extremal k-CNF Formulas2013
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  European Journal of Combinatorics
  
  Volume: 未定
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500006
[Journal Article] On Extremal k-CNF Formulas2013
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  European Journal of Combinatorics
  
  Volume: 未定
- Peer Reviewed
- Data Source
  KAKENHI-PLANNED-24106006
[Journal Article] ハッピーエンド問題に対する極値的頂点集合の構造2013
- Author(s)
  重田　真那実，天野　一幸
- Journal Title
  
  電子情報通信学会論文誌A
  
  Volume: J96-A-7 Pages: 440-451
- NAID
  110009615695
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-24500006
[Journal Article] Tight Bounds on the Average Sensitivity of k-CNF2011
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Theory of Computing
  
  Volume: 7 Pages: 45-48
- NAID
  110008583105
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas2011
- Author(s)
  天野一幸
- Journal Title
  
  Chicago Journal of Theoretical Computer Science
  
  Volume: 2011(3) Pages: 1-11
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] Tight Bounds on the Average Sensitivity of k-CNF2011
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Theory of Computing 7
  
  Pages: 45-48
- NAID
  110008583105
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] A Well-Mixed Function with Circuit Complexity 5n : Tightness of the Lachish-Raz-type Bounds2011
- Author(s)
  天野一幸, 垂井淳
- Journal Title
  
  A Well-Mixed Function with Circuit Complexity 5n : Tightness of the Lachish-Raz-type Bounds
  
  Volume: 412(18) Pages: 1646-1651
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] A Well-Mixed Function with Circuit Complexity 5n : Tightness of the Lachish-Raz-type Bounds2011
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 412(8) Pages: 1646-1651
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] Minterm-Transitive Functions with Asymptotically Smallest Block Sensitivity2011
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Information Proceesing Letters
  
  Volume: 111(23-24) Issue: 23-24 Pages: 1281-1284
- DOI
  10.1016/j.ipl.2011.09.008
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] A Well-Mixed Function with Circuit Complexity 5n : Tightness of the Lachish-Raz-type Bounds2011
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Theoretical Computer Science 412(8)
  
  Pages: 1646-1651
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] Tight Bounds on the Average Sensitivity of k-CNF2011
- Author(s)
  天野一幸
- Journal Title
  
  Theory of Computing
  
  Volume: 7 Pages: 45-48
- NAID
  110008583105
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] Minterm-Transitive Functions with Asymptotically Smallest Block Sensitivity2011
- Author(s)
  天野一幸
- Journal Title
  
  Information Processing Letters
  
  Volume: 111(23-24) Pages: 1281-1284
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] On Extremal k-CNF Formulas2011
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Electronic Notes in Discrete Mathematics
  
  Volume: 38 Pages: 37-42
- DOI
  10.1016/j.endm.2011.09.007
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] A Well-Mixed Function with Circuit Complexity 5n : Tightness of the Lachish-Raz-type Bounds2011
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Theoretical Computer Science
  
  Volume: 412(8) Pages: 1646-1651
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] New Upper Bounds on the Average PTF Density of Boolean Functions2010
- Author(s)
  天野一幸
- Journal Title
  
  Lecture Notes in Computer Science
  
  Volume: 6506 Pages: 304-315
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] NPN-Representatives of a Set of Optimal Boolean Formulas2010
- Author(s)
  福原秀明, 瀧本英二, 天野一幸
- Journal Title
  
  IEICE Trans. on Fund. Elect. Communications and Computer Science
  
  Volume: E-93-A-6 Pages: 1008-1015
- NAID
  10026864513
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] k-Subgraph Isomorphism on ACO Circuit2010
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Computational Complexity
  
  Volume: 19 Pages: 183-210
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] k-Subgraph Isomorphism on AC0 Circuit2010
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Computational Complexity
  
  Volume: 19 Pages: 183-210
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] k-Subgraph Isomorphism on AC0 Circuits2010
- Author(s)
  天野一幸
- Journal Title
  
  Computational Complexity
  
  Volume: 19(2) Pages: 183-210
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas2010
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Conferences in Research and Practice in Information Technology 109
  
  Pages: 25-29
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] On Directional vs.Undirectional Randomized Decision Tree Complexity for Read-Once Formulas2010
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Conferences in Research and Practice in Information Technology 109
  
  Pages: 25-29
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] k-Subgraph Isomorphism on ACO Circuit2010
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Computational Complexity 19
  
  Pages: 183-210
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] K-Subgraph Isomorphism on AC0 Circuit2009
- Author(s)
  天野一幸
- Journal Title
  
  Proceedings of the 24^<th> IEEE Conference on Computational Complexity (in press)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] k-Subgraph Isomorphism on ACO Circuits2009
- Author(s)
  天野一幸
- Journal Title
  
  Proceedings of the 24th IEEE Conference on Computational Complexity 24(in press)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] Bounds on the Size of Small Depth Circuits for Approximating Majority2009
- Author(s)
  天野一幸
- Journal Title
  
  Lecture Notes in Computer Science 5555(in press)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] K-Subgraph Isomorphism on AC_0 Circuits2009
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Proceedings of the 24^<th> IEEE Conference on Computational Complexity 24
  
  Pages: 9-18
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] Bounds on the Size of Small Depth Circuits for Approximating Majority2009
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Letcute Notes in Computer Science 5555
  
  Pages: 59-70
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-21500005
[Journal Article] Bounds on the Size of Small Depth Circuit for Approximation Majority2009
- Author(s)
  天野一幸
- Journal Title
  
  Proceedings of the 36^<th> International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science (in press)
  
  Pages: 5555-5555
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] K-Subgraph Isomorphism on AC_0 Circuits2009
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Proceedings of the 24^<th> IEEE Conference on Computational Complexity 24
  
  Pages: 9-18
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] A Well Mixed Function with Circuit Complexity 5n +- o(n)2008
- Author(s)
  天野一幸
- Journal Title
  
  Lecture Notes in Computer Science 4978
  
  Pages: 342-350
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] A Well-Mixed Function with Circuit Compleixty 5n+-0(n)2008
- Author(s)
  天野一幸
- Journal Title
  
  Lecture Notes in Computer Science 4978
  
  Pages: 342-350
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] Monotone DNF Formulas that has a Minimal or Maximal Number of Satisfying Assignments2008
- Author(s)
  佐藤貴之, 天野一幸, 瀧本英二, 丸岡章
- Journal Title
  
  Lecture Notes in Computer Science 5092
  
  Pages: 191-203
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] Representation of Quantum Circuits with Clifford and π/8 Gates2008
- Author(s)
  松本健, 天野一幸
- Journal Title
  
  Proceedings of the 8^<th> Asian Conference on Quantum Information Science
  
  Pages: 135-136
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] A Well-Mixed Function with Circuit Compleixty 5n+-o(n)2008
- Author(s)
  天野一幸
- Journal Title
  
  Lecture Notes in Computer Science 4978
  
  Pages: 191-203
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500760
[Journal Article] Better upper bounds on the QOBDD size of integer multiplication2007
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Discrete Applied Mathematics 155(10)
  
  Pages: 1224-1232
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-16092201
[Journal Article] Better Upper Bounds on the QOBDD Size of Integer Multiplication2007
- Author(s)
  K.Amano, A.Maruoka
- Journal Title
  
  Discrete Applied Mathematics 155
  
  Pages: 1224-1232
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] Better Upper Bounds on the QOBDD Size of Integer Multiplication2007
- Author(s)
  Kazuyuki Amano and Akira Maruoka
- Journal Title
  
  Discrete Applied Mathematcis, 155(10)
  
  Pages: 1224-1232
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] Better Upper Bounds on the QOBDD Size of Integer Multipication2007
- Author(s)
  天野一幸
- Journal Title
  
  Diabetes Applied Mathematics 155(10)
  
  Pages: 1224-1232
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Journal Article] Better Upper Bounds on the QOBDD Size of Integer Mutliplication2007
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Disc. Appl. Math 155
  
  Pages: 1224-1232
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] On the Negation-Limited Circuit Complexity of Sorting and Inverting K-tonic Sequences2006
- Author(s)
  Takayuki Sato, Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Lecture Notes in Computer Science 4112
  
  Pages: 104-115
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] On the Monotone Circuit Complexity of Quadratic Boolean Functions2006
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Algorithmica (発表予定)
- NAID
  110003206393
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] Monotone Circuit Complexity of Quadratic Boolean Functions2006
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Algorithmica 46(1)
  
  Pages: 3-14
- NAID
  110003206393
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] On the Monotone Circuit Complexity of Quadratic Boolean Functions2006
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Algorithmica (in press)
- NAID
  110003206393
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] On Learning Monotone Boolean Functions under the Uniform Distribution2006
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Theoretical Computer Science (Special Issue on ALT 2002) 350(1)
  
  Pages: 3-12
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] A Procedure that Generates a Class of Optimal Boolean Formulas2006
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  情報処理学会アルゴリズム研究会 2006-AL-106
  
  Pages: 1-8
- NAID
  110004824066
- Data Source
  KAKENHI-PROJECT-16092201
[Journal Article] On the Negation-Limited Circuit Complexity of Sorting and Inverting K-tonic Sequences2006
- Author(s)
  T.Sato, K.Amano, A.Maruoka
- Journal Title
  
  Lecture Notes in Computer Science 4112
  
  Pages: 104-115
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] On the Monotone Circuit Complexity of Quadratic Boolean Functions2006
- Author(s)
  K.Amano, A.Maruoka
- Journal Title
  
  Algorithmica 46・1
  
  Pages: 3-14
- NAID
  110003206393
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] On Learning Monotone Boolean Functions under the Uniform Distribution2006
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Theoretical Computer Science 350・1
  
  Pages: 3-12
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] On the Monotone Circuit Complexity of Quadratic Boolean Functions2006
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Algorithmica 46・1
  
  Pages: 3-14
- NAID
  110003206393
- Data Source
  KAKENHI-PROJECT-16092201
[Journal Article] On Learning Monotone Boolean Functions under the Uniform Distribution2006
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Theoretical Computer Science 350(1)
  
  Pages: 3-12
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] 回路計算量の線形下界に対する計算機支援証明について2006
- Author(s)
  天野一幸
- Journal Title
  
  電子情報通信学会技術研究報告 COMP2006-39
  
  Pages: 65-70
- NAID
  110004851556
- Data Source
  KAKENHI-PROJECT-16092201
[Journal Article] Tighter Bounds on the OBDD Size of Integer Multiplication2005
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Proc.of 4th Japanese-Hungarian Symp.on Disc.Math.and its Applications
  
  Pages: 9-15
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates2005
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  SIAM Journal on Computing 35(1)
  
  Pages: 3-12
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] Random Projection and Its Application to Learning2005
- Author(s)
  Tatsuya Watanabe, Eiji Takimoto, Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Proc.2005 Workshop on Randomness and Computation
  
  Pages: 3-4
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] On the Complexity of Depth-2 Circuits with Threshold Gates2005
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Lecture Notes in Computer Science 3618
  
  Pages: 107-118
- Data Source
  KAKENHI-PROJECT-16092201
[Journal Article] A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at Most (1/6)loalog n Negation Gates2005
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  SIAM Journal on Computing 35(1)
  
  Pages: 201-216
- Data Source
  KAKENHI-PROJECT-16092201
[Journal Article] On the Complexity of Depth-2 Circuits with Threshold Gates2005
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Lecture Notes in Computer Science (Proc.of 30th MFCS) 3618
  
  Pages: 107-118
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] Random Projection and Its Application to Learning2005
- Author(s)
  Tatsuya Watanabe, Eiji Takimoto, Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Proc.2005 Workshop on Randomness and Computation
  
  Pages: 3-4
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] Random Projection and Its Application to Learning2005
- Author(s)
  Tatsuya Watanabe, Eiji Takimoto, Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Proceedings of 2005 Workshop on Randomness and Computation
  
  Pages: 3-4
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] Monotone Boolean Functions with s Zeros Farthest from Threshold Functions2005
- Author(s)
  Kazuyuk i Amano
- Journal Title
  
  Discrete Mathematics and Theoretical Computer Science Vol.AE
  
  Pages: 11-16
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] On Learning Monotone Boolean Functions under the Uniform Distribution2005
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Theoretical Computer Science (発表予定)
- Data Source
  KAKENHI-PROJECT-15700003
[Journal Article] On the Complexity of Depth-2 Circuits with Threshold Gates2005
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Lecture Notes in Computer Science 3618
  
  Pages: 107-118
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] Tighter Bounds on the OBDD Size of Integer Multiplication2005
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Proc. 4^<th> Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications 4
  
  Pages: 9-15
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates2005
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  SIAM Journal on Computing 35(1)
  
  Pages: 201-216
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] On Learning Monotone Boolean Functions under the Uniform Distribution2005
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Theoretical Computer Science (掲載予定)
- Data Source
  KAKENHI-PROJECT-16092201
[Journal Article] マージンを保存するランダム性を限定したプロジェクションとブール空間への埋め込み2005
- Author(s)
  Tatsuya Watanabe, Eiji Takimoto, Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  電子情報通信学会技術研究報告(コンピュテーション) COMP39
  
  Pages: 21-28
- NAID
  110003499882
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] On Learning Monotone Boolean Functions under the Uniform Distribution2005
- Author(s)
  Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Theoretical Computer Science 印刷中
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] Monotone Boolean Functions with s Zeros Farthest from Threshold Functions2005
- Author(s)
  Kazuyuki Amano, Jun Tarui
- Journal Title
  
  Discrete Math.and Theoretical Computer Science, AE (Proc.EuroComb'05)
  
  Pages: 11-16
- Data Source
  KAKENHI-PROJECT-17650001
[Journal Article] A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most 1/6loglogn Negation Gates2005
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  SIAM Journal on Computing 35・1
  
  Pages: 201-216
- Data Source
  KAKENHI-PROJECT-17700001
[Journal Article] Random Projection and Its Application to Learning2005
- Author(s)
  Tatsuya Watanabe, Eiji Takimoto, Kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Proceedings of 2005 Workshop on Randomness and Computation 3-4
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] The Potential of the Approximation Method2004
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  SIAM Journal of Computing 33・2
  
  Pages: 433-447
- Data Source
  KAKENHI-PROJECT-15700003
[Journal Article] On the Monotone Circuit Complexity of Quadratic Boolean Functions2004
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Lecture Notes in Computer Science 3341
  
  Pages: 28-40
- NAID
  110003206393
- Data Source
  KAKENHI-PROJECT-15700003
[Journal Article] On the Monotone Circuit Complexity of Quadratic Boolean Functions2004
- Author(s)
  kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Lecture Notes in Computer Science 3341
  
  Pages: 28-40
- NAID
  110003206393
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] The Potential of the Approximation Method2004
- Author(s)
  kazuyuki Amano, Akira Maruoka
- Journal Title
  
  SIAM Jounral On Computing 33(2)
  
  Pages: 433-447
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] Better Simulation of Exponential Threshold Weights by Polynomial Weights2004
- Author(s)
  kazuyuki Amano, Akira Maruoka
- Journal Title
  
  Electronic Colloquium on Computational Complexity 11
- NAID
  10014326006
- Data Source
  KAKENHI-PROJECT-15300001
[Journal Article] Better Simulation of Exponential Threshold Weights by Polynomial Weights2004
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Electronic Colloquium on Computational Complexity 11
- NAID
  10014326006
- Data Source
  KAKENHI-PROJECT-15700003
[Journal Article] Better Simulation of Exponential Threshold Weights by Polynomial Weights2004
- Author(s)
  Kazuyuki Amano
- Journal Title
  
  Electronic Colloquium on Computational Complexity 11
- NAID
  10014326006
- Data Source
  KAKENHI-PROJECT-16092201
[Journal Article] A Well-Mixed Function with Circuit Complexity 5n+o(n)
- Author(s)
  天野一幸, 垂井淳
- Journal Title
  
  Tightness of the Lachish-Raz-type Bounds, Lecture Notes in Computer Science
  
  Pages: 342-350
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] GAを用いたコンテナ積み込み問題の解探索に対するACOによる後処理手法2024
- Author(s)
  影山　祥，荒木　徹也，天野　一幸
- Organizer
  2023 年度電子情報通信学会東京支部学生会研究発表会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 2x2x1ピースを用いたアンチスライドの充填率の上界2023
- Author(s)
  木村健斗, 天野一幸
- Organizer
  2022年度冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 1次元セルオートマトンのルール30の解析2023
- Author(s)
  内田　明良，天野　一幸
- Organizer
  電子情報通信学会東京支部学生会研究発表会
- Data Source
  KAKENHI-PROJECT-21K19758
[Presentation] Depth-Three Circuits for Inner Product and Majority Functions2023
- Author(s)
  Kazuyuki Amano
- Organizer
  34th International Symposium on Algorithms and Computation (ISAAC 2023)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K19758
[Presentation] パズル「しろなべ」の計算複雑性2023
- Author(s)
  篠原広佑, 荒木徹也, 天野一幸
- Organizer
  2022年度冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-21K19758
[Presentation] Knights Exchange Puzzleの一般化に関する研究2023
- Author(s)
  田島　大也，天野　一幸
- Organizer
  電子情報通信学会東京支部学生会研究発表会
- Data Source
  KAKENHI-PROJECT-21K19758
[Presentation] 2x2x1ピースを用いたアンチスライドの充填率の上界2023
- Author(s)
  木村健斗, 天野一幸
- Organizer
  2022年度冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-21K19758
[Presentation] パズル「しろなべ」の計算複雑性2023
- Author(s)
  篠原広佑, 荒木徹也, 天野一幸
- Organizer
  2022年度冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] Knights Exchange Puzzleの一般化に関する研究2023
- Author(s)
  田島　大也，天野　一幸
- Organizer
  電子情報通信学会東京支部学生会研究発表会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 1次元セルオートマトンのルール30の解析2023
- Author(s)
  内田　明良，天野　一幸
- Organizer
  電子情報通信学会東京支部学生会研究発表会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] Upper Bounds on the Minimum Number of Pieces for Anti-slide Packing2022
- Author(s)
  Kento Kimura and Kazuyuki Amano
- Organizer
  The 24th JCDCG^3
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] Upper Bounds on the Minimum Number of Pieces for Anti-slide Packing2022
- Author(s)
  Kento Kimura and Kazuyuki Amano
- Organizer
  The 24th JCDCG^3
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K19758
[Presentation] Lower bounds for the total stopping time of 3x+1 iterates revisited2021
- Author(s)
  天野一幸
- Organizer
  電子情報通信学会、コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] On the size of depth-two threshold circuits for the inner product mod 2 function2021
- Author(s)
  Kazuyuki Amano
- Organizer
  The 14th-15th International Conference on Language and Automata Theory and Applications (LATA 2020 & 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-21K19758
[Presentation] Lower bounds for the total stopping time of 3x+1 iterates revisited2021
- Author(s)
  Kazuyuki Amano
- Organizer
  電子情報通信学会、コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-21K19758
[Presentation] Lower bounds for the total stopping time of 3x+1 iterates revisited2021
- Author(s)
  Kazuyuki Amano
- Organizer
  電子情報通信学会、コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] On the size of depth-two threshold circuits for the inner product mod 2 function2021
- Author(s)
  Kazuyuki Amano
- Organizer
  The 14th-15th International Conference on Language and Automata Theory and Applications (LATA 2020 & 2021)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 分散処理によるTopswopsの最大手数の発見2021
- Author(s)
  木村健斗、高橋篤生、荒木徹也、天野一幸
- Organizer
  情報処理学会、アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] SATソルバーによる複数の折り方を持つ箱の展開図の探索2020
- Author(s)
  只木莉緒奈，天野一幸
- Organizer
  情報処理学会アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] T-テトロミノを用いた平面アンチスライドパズルの最少ピース数について2020
- Author(s)
  木村健斗，天野一幸，荒木徹也
- Organizer
  2020年電子情報通信学会総合大会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 数理計画を用いた閾値回路の計算複雑さの解析2020
- Author(s)
  天野　一幸
- Organizer
  情報処理学会第176回アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 数理計画を用いた閾値回路の計算複雑さの解析2020
- Author(s)
  天野一幸
- Organizer
  情報処理学会アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] SATソルバーによる複数の折り方を持つ箱の展開図の探索2020
- Author(s)
  只木莉緒奈，天野一幸
- Organizer
  情報処理学会第176回アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 多数決関数を計算する２段の多数決回路における総入次数の上下界2020
- Author(s)
  横川拓哉，尾島康浩，天野一幸
- Organizer
  2019年度冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] T-テトロミノを用いた平面アンチスライドパズルの最少ピース数について2020
- Author(s)
  木村健斗，天野一幸，荒木徹也
- Organizer
  電子情報通信学会総合大会 COMP学生シンポジウム
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] 多数決関数を計算する２段の多数決回路における総入次数の上下界2020
- Author(s)
  横川拓哉, 尾島康浩, 天野一幸
- Organizer
  2019年度冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 凹凸のあるピースにおけるアンチスライドパズルの解析2019
- Author(s)
  木村健斗, 天野一幸
- Organizer
  組み合わせゲーム・パズルプロジェクト(CGP)　第１４回研究集会
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] ポリオミノのisohedralタイリング数の解析2019
- Author(s)
  佐藤大河, 天野一幸
- Organizer
  情報処理学会第171回アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] アンチスライドパズルの解析2019
- Author(s)
  木村健斗，天野一幸，荒木徹也
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] 多数決関数を計算する2段の多数決回路2019
- Author(s)
  尾島康浩，横川拓哉，天野一幸
- Organizer
  電子情報通信学会　コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 多数決関数を計算する2段の多数決回路2019
- Author(s)
  尾島康浩，横川拓哉，天野一幸
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] アンチスライドパズルの解析2019
- Author(s)
  木村健斗，天野一幸，荒木徹也
- Organizer
  電子情報通信学会　コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] ポリオミノのisohedralタイリング数の解析2019
- Author(s)
  佐藤大河, 天野一幸
- Organizer
  情報処理学会第171回アルゴリズム研究会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] 凹凸のあるピースにおけるアンチスライドパズルの解析2019
- Author(s)
  木村健斗, 天野一幸
- Organizer
  組み合わせゲーム・パズルプロジェクト(CGP)　第１４回研究集会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] Away from Rivals2018
- Author(s)
  Kazuyuki Amano and Shin-ichi Nakano
- Organizer
  30th Canadian Conference on Computational Geometry (CCCG 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] Away from rivals2018
- Author(s)
  Kazuyuki Amano, Shin-ichi Nakano
- Organizer
  The 30th Canadian Conference on Computational Geometry
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] An Approximation Algorithm for the 2-Dispersion Problem2018
- Author(s)
  Kazuyuki Amano, Shin-ichi Nakano
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] An Approximation Algorithm for the 2-Dispersion Problem2018
- Author(s)
  Kazuyuki Amano, Shin-ichi Nakano
- Organizer
  電子情報通信学会コンピュテーション研究会
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] アンチスライドパズルの解析2018
- Author(s)
  木村健斗，天野一幸
- Organizer
  日本OR学会SSOR2018
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] アンチスライドパズルの解析2018
- Author(s)
  木村健斗，天野一幸
- Organizer
  日本OR学会SSOR2018
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] Depth two majority circuits for majority and list expanders2018
- Author(s)
  Kazuyuki Amano
- Organizer
  The 43rd International Symposium on Mathematical Foundations of Computer Science
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18H04090
[Presentation] 多数決関数を計算する２層の多数決回路について2018
- Author(s)
  吉田　昌史，天野　一幸
- Organizer
  2017年度冬のLAシンポジウム
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] Away from Rivals2018
- Author(s)
  Kazuyuki Amano, Shin-ichi Nakano
- Organizer
  the 30th Canadian Conference on Computational Geometry (CCCG 2018)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-18K11152
[Presentation] On the Number of p4-tilings by an n-Omino2017
- Author(s)
  Kazuyuki Amano and Yoshinobu Haruyama
- Organizer
  28th International Symposium on Algorithms and Computation (ISAAC 2017)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] Enumeration of Boolean Functions of Sensitivity Three and Inheritance of Nondegeneracy2017
- Author(s)
  Kazuyuki Amano
- Organizer
  2017 IEEE International Symposium on Information Theory, ISIT 2017
- Place of Presentation
  Aachen, Germany
- Year and Date
  2017-06-25
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106006
[Presentation] Enumeration of Boolean Functions of Sensitivity Three and Inheritance of Nondegeneracy2017
- Author(s)
  Kazuyuki Amano
- Organizer
  2017 IEEE International Symposium on Information Theory, ISIT 2017
- Place of Presentation
  Aachen, Germany
- Year and Date
  2017-06-25
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy2017
- Author(s)
  Kazuyuki Amano
- Organizer
  IEEE International Symposium on Information Theory (ISIT 2017)
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] 多項式しきい値表現のXOR補題と整数計画のテンソル積2016
- Author(s)
  天野一幸
- Organizer
  日本OR学会最適化の基盤とフロンティア研究部会
- Place of Presentation
  東京理科大 (東京都新宿区)
- Invited
- Data Source
  KAKENHI-PLANNED-24106006
[Presentation] On XOR Lemma for Polynomial Threshold Weight and Length2016
- Author(s)
  Kazuyuki Amano
- Organizer
  The 10th International Conference on Language and Automata Theory and Applications (LATA '16)
- Place of Presentation
  プラハ（チェコ）
- Year and Date
  2016-03-15
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-24500006
[Presentation] 多項式しきい値表現のＸＯＲ補題と整数計画のテンソル積2016
- Author(s)
  天野　一幸
- Organizer
  日本ＯＲ学会　最適化の基盤とフロンティア研究部会
- Place of Presentation
  東京理科大学（東京都新宿区）
- Year and Date
  2016-04-23
- Invited
- Data Source
  KAKENHI-PROJECT-24500006
[Presentation] On XOR Lemma for Polynomial Threshold Weight and Length2016
- Author(s)
  Kazuyuki Amano
- Organizer
  The 10th International Conference on Language and Automata Theory and Applications
- Place of Presentation
  Prague (Czech Republic)
- Year and Date
  2016-03-15
- Int'l Joint Research
- Data Source
  KAKENHI-PLANNED-24106006
[Presentation] 論理関数のPTF表現のXOR補題について2016
- Author(s)
  天野一幸，舘将馬
- Organizer
  2016年夏のLAシンポジウム
- Place of Presentation
  かんぽの宿大和平群 (奈良県生駒郡)
- Year and Date
  2016-07-19
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] 論理関数のPTF表現のXOR補題について2016
- Author(s)
  天野一幸，舘将馬
- Organizer
  2016年夏のLAシンポジウム
- Place of Presentation
  かんぽの宿大和平群 (奈良県生駒郡)
- Year and Date
  2016-07-19
- Data Source
  KAKENHI-PLANNED-24106006
[Presentation] Sensitivityが3の論理関数について2016
- Author(s)
  天野一幸
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  広島大 (広島県東広島市)
- Year and Date
  2016-12-21
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] 多項式しきい値表現のXOR補題と整数計画のテンソル積2016
- Author(s)
  天野　一幸
- Organizer
  日本OR学会最適化の基盤とフロンティア研究部会
- Place of Presentation
  東京理科大学（東京都新宿区）
- Year and Date
  2016-04-23
- Invited
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] On XOR Lemma for Polynomial Threshold Weight and Length2016
- Author(s)
  Kazuyuki Amano
- Organizer
  The 10th International Conference on Language and Automata Theory and Applications (LATA '16)
- Place of Presentation
  プラハ（チェコ）
- Year and Date
  2016-03-15
- Int'l Joint Research
- Data Source
  KAKENHI-PROJECT-15K00006
[Presentation] Sensitivityが3の論理関数について2016
- Author(s)
  天野一幸
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  広島大 (広島県東広島市)
- Year and Date
  2016-12-21
- Data Source
  KAKENHI-PLANNED-24106006
[Presentation] A Nonuniform Circuit Class with Multilayer of Threshold Gates having Super Quasi Polynomial Size Lower Bounds against NEXP2014
- Author(s)
  Kazuyuki Amano and Atsushi Saito
- Organizer
  電子情報通信学会　コンピュテーション研究会
- Place of Presentation
  崇城大学（熊本県熊本市）
- Year and Date
  2014-12-05
- Data Source
  KAKENHI-PROJECT-24500006
[Presentation] Ordered Biclique Partition と通信計算量2014
- Author(s)
  重田　真那実，天野　一幸
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PROJECT-24500006
[Presentation] Ordered Biclique Partition と通信計算量2014
- Author(s)
  重田真那実, 天野一幸
- Organizer
  冬のLAシンポジウム
- Place of Presentation
  京都大学
- Data Source
  KAKENHI-PLANNED-24106006
[Presentation] A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits2014
- Author(s)
  Kazuyuki Amano and Atsushi Saito
- Organizer
  電子情報通信学会　コンピュテーション研究会
- Place of Presentation
  東北大学（宮城県仙台市）
- Year and Date
  2014-04-24
- Data Source
  KAKENHI-PROJECT-24500006
[Presentation] Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions2011
- Author(s)
  Kazuyuki Amano
- Organizer
  The 22nd Annual ACM-SIAM Symposium on Disc rete Algorithms (SODA 2011)
- Place of Presentation
  サンフランシスコ(米国)
- Year and Date
  2011-01-25
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] もっとも敏感なk-CNF2011
- Author(s)
  天野一幸
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  秋田県立大学(秋田県)
- Year and Date
  2011-05-16
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] もっとも敏感なk-CNF式2011
- Author(s)
  天野一幸
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  秋田県立大学
- Year and Date
  2011-05-16
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions2011
- Author(s)
  天野一幸
- Organizer
  The 22^<nd> Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011)
- Place of Presentation
  HolidayInn Hotel(サンフランシスコ,アメリカ合衆国)
- Year and Date
  2011-01-25
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] 多項式しきい値関数密度の上界の改善2011
- Author(s)
  早坂智行, 天野一幸
- Organizer
  第73回情報処理学会全国大会
- Place of Presentation
  東京工業大学(東京都)
- Year and Date
  2011-03-04
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] On Extremal k-CNF Formulas, European Conf. on Combinatorics2011
- Author(s)
  天野一幸
- Organizer
  Graph Theory and Applications
- Place of Presentation
  Renyi研究所(ブタペスト,ハンガリー)
- Year and Date
  2011-09-02
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] On Extremal k-CNF Formulas2011
- Author(s)
  Kazuyuki Amano
- Organizer
  European Conf.on Cobinatorics, Graph Theory and Applications
- Place of Presentation
  ブタペスト(ハンガリー)
- Year and Date
  2011-09-02
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] On Directional vs.Undirectional Randomized Decision Tree Complexity for Read-Once Formulas2010
- Author(s)
  Kazuyuki Amano
- Organizer
  The 16^<th> Computing : Australasian Theory Syposium
- Place of Presentation
  ブリスベン(豪州)
- Year and Date
  2010-01-19
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] 論理関数の乱化計算機計算量について2010
- Author(s)
  天野一幸
- Organizer
  日本OR学会NEO研究集会
- Place of Presentation
  京都大学(京都府)
- Year and Date
  2010-12-07
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] ギガ頂点グラフのハミルトン路探索と中間層予想について2010
- Author(s)
  島田学, 天野一幸
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  北陸先端科学技術大学(石川県)
- Year and Date
  2010-05-19
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] New Upper Bounds on the Average PTF Density of Boolean Functions2010
- Author(s)
  天野一幸
- Organizer
  The 21^<st> International Symposium on Algorithm and Computation (ISAAC 2010)
- Place of Presentation
  ラマダプラザホテル(済州島,韓国)
- Year and Date
  2010-12-15
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] 論理関数の乱化決定木計算量について2010
- Author(s)
  天野一幸
- Organizer
  日本OR学会NEO研究集会
- Place of Presentation
  京都大学
- Year and Date
  2010-12-07
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] New Upper Bounds on the Average PTF Density of Boolean Functigiis2010
- Author(s)
  Kazuyuki Amano
- Organizer
  The 21st International Symposium on Algorithm and Computation (ISAAC 2010)
- Place of Presentation
  済州島(韓国)
- Year and Date
  2010-12-15
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] Bounds on the Size of Small Depth Circuits for Approximating Majority2009
- Author(s)
  天野一幸
- Organizer
  The 36^<th> International Colloquium on Automata, Languages and Programming (ICALP09)
- Place of Presentation
  ロドスパレスホテル(ロドス,ギリシャ)
- Year and Date
  2009-07-09
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] K-Subgraph Isomorphism on AC_0 Circuits2009
- Author(s)
  Kazuyuki Amano
- Organizer
  The 24^<th> IEEE Conference on Computational Complexity
- Place of Presentation
  パリ(フランス)
- Year and Date
  2009-07-15
- Data Source
  KAKENHI-PROJECT-20500760
[Presentation] Bounds on the Size of Small Depth Circuits for Approximating Majority2009
- Author(s)
  Kazuyuki Amano
- Organizer
  The 36th International Colloquium on Automata, Languages and Programming
- Place of Presentation
  ロドス(ギリシャ)
- Year and Date
  2009-07-09
- Data Source
  KAKENHI-PROJECT-20500760
[Presentation] Bounds on the Size of Small Depth Circuits for Approximating Majority2009
- Author(s)
  Kazuyuki Amano
- Organizer
  The 36th International Colloquium on Automata, Languages and Programming
- Place of Presentation
  ロドス(ギリシャ)
- Year and Date
  2009-07-09
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] 最簡な論理式でNPN同値類の代表のみを生成するアルゴリズム2009
- Author(s)
  福原秀明, 滝本英二, 天野一幸
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  東京
- Year and Date
  2009-03-01
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] K-Subgraph Isomorphism on AC_0 Circuits2009
- Author(s)
  Kazuyuki Amano
- Organizer
  The 24^<th> IEEE Conference on Computational Complexity
- Place of Presentation
  パリ(フランス)
- Year and Date
  2009-07-15
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] K-subgraph Isomorphism on AC0 Circuits2009
- Author(s)
  天野一幸
- Organizer
  The 24^<th> IEEE conf. on computational complexity
- Place of Presentation
  ポアンカレ研究所(パリ,フランス)
- Year and Date
  2009-07-15
- Data Source
  KAKENHI-PROJECT-21500005
[Presentation] 部分グラフ同型性判定の回路計算量について2008
- Author(s)
  天野一幸
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  群馬県伊香保
- Year and Date
  2008-12-03
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] 部分グラフ同型性判定の回路計算量について2008
- Author(s)
  天野一幸
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  群馬県伊香保町
- Year and Date
  2008-12-03
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] Clifford+π/8量子回路の計算能力2008
- Author(s)
  松本健, 天野一幸
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  神奈川
- Year and Date
  2008-03-10
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] A Well-Mixed Function with Circuit Compleixty 5n+-0(n)2008
- Author(s)
  天野一幸
- Organizer
  第5回計算モデルの理論と応用国際会議(TAMC08)
- Place of Presentation
  中国・西安
- Year and Date
  2008-04-28
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] 回路計算量の5nの下界に対する5nの上界2007
- Author(s)
  天野一幸
- Organizer
  夏のLAシンポジウム
- Place of Presentation
  休暇村能登千里浜
- Year and Date
  2007-07-20
- Data Source
  KAKENHI-PROJECT-16092201
[Presentation] 回路計算量の5nの下界に対する5nの上界2007
- Author(s)
  天野一幸
- Organizer
  2007年夏のLAシンポジウム
- Place of Presentation
  石川県羽咋市
- Year and Date
  2007-07-20
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] 方形描画の数え上げ2007
- Author(s)
  天野一幸, 中野眞一, 山中克久
- Organizer
  電子情報通信学会コンピュテーション研究会
- Place of Presentation
  新潟
- Year and Date
  2007-11-28
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] 方形描画(フロアプラン)の個数について:厳密数え上げと下界と上界2007
- Author(s)
  天野一幸
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  新潟大学
- Year and Date
  2007-11-30
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] A well-mixed function with circuit complexity 5n±o(n): Tightness of the Lachish-Raz-type bounds2007
- Author(s)
  Kazuyuki Amano
- Organizer
  The 10th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 07)
- Place of Presentation
  Chonnam National University, Korea
- Year and Date
  2007-08-09
- Data Source
  KAKENHI-PROJECT-16092201
[Presentation] A Well-Mixed Function with Circuit Complexity 5n + o(n) : Tightness of the Lachish-Raz-type Bounds2007
- Author(s)
  天野一幸, 垂井淳
- Organizer
  The 10th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 07)
- Place of Presentation
  光州(韓国)
- Year and Date
  2007-08-09
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] 回路計算量の5nの下界に対する5nの上界2007
- Author(s)
  天野一幸, 垂井淳
- Organizer
  2007年夏のLAシンポジウム
- Place of Presentation
  石川
- Year and Date
  2007-07-20
- Data Source
  KAKENHI-PROJECT-19500006
[Presentation] On the number of rectangular drawings: Exact counting and lower and upper bounds2007
- Author(s)
  Kazyuki Amano
- Organizer
  情報処理学会アルゴリズム研究会
- Place of Presentation
  新潟大学
- Year and Date
  2007-11-30
- Data Source
  KAKENHI-PROJECT-16092201
[Presentation] A Nonuniform Circuit Class with Multilayer of Threshold Gates having Super Quasi Polynomial Size Lower Bounds against NEXP
- Author(s)
  Kazuyuki Amano and Atsushi Saito
- Organizer
  The 9th International Conference on Language and Automata Theory and Applications
- Place of Presentation
  ニース（フランス）
- Year and Date
  2015-03-02 – 2015-03-06
- Data Source
  KAKENHI-PROJECT-24500006
[Presentation] Graph Partition and Communication Complexity
- Author(s)
  Kazuyuki Amano
- Organizer
  ELC Mini-Workshop on Boolean Functions
- Place of Presentation
  東工大田町キャンパス（東京都目黒区）
- Year and Date
  2014-11-07 – 2014-11-10
- Data Source
  KAKENHI-PROJECT-24500006
[Presentation] A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits
- Author(s)
  Kazuyuki Amano and Atsushi Saito
- Organizer
  The 17th Korea-Japan Joint Workshop on Algorithms and Computation
- Place of Presentation
  沖縄コンベンションセンター（沖縄県宜野湾市）
- Year and Date
  2014-07-13 – 2014-07-15
- Data Source
  KAKENHI-PROJECT-24500006
[Presentation] A Nonuniform Circuit Class with Multilayer of Threshold Gates having Super Quasi Polynomial Size Lower Bounds against NEXP
- Author(s)
  Atsushi Saito and Kazuyuki Amano
- Organizer
  電子情報通信学会総合大会
- Place of Presentation
  立命館大学（滋賀県草津市）
- Year and Date
  2015-03-10 – 2015-03-13
- Data Source
  KAKENHI-PROJECT-24500006

1. TAKIMOTO Eiji (50236395)

# of Collaborated Projects: 5 results

# of Collaborated Products: 5 results
2. MARUOKA Akira (50005427)

# of Collaborated Projects: 4 results

# of Collaborated Products: 20 results
3. KAWASHIMA Ryuta (90250828)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
4. MURAMOTO Toshiaki (80212257)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
5. HARAGUCHI Kazuya (80453356)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
6. Avis David (90584110)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
7. Watanabe Osamu (80158617)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
8. 酒井義文 (10277361)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
9. 阿曽弘具 (10005522)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
10. 上野賢哉 (70586081)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
11. 伊東利哉 (20184674)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
12. 玉置卓 (40432413)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
13. 森立平 (60732857)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
14. 平原秀一 (80848440)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results
15. 清水伸高 (10910127)

# of Collaborated Projects: 1 results

# of Collaborated Products: 0 results

Amano Kazuyuki 天野 一幸

AMANO Kazuyuki 天野 一幸

Research Projects

Research Products

Co-Researchers

計算理論と数学の交差点：計算複雑性理論によるメタ解析Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

「計算」の視点から見る数学的難問Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Experimental Computational Complexity Theory - Its Establishment and DevelopmentPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Computational Complexity of Minimum Description Size Problems

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Extending NP-Hardness via the development of computational Ramsey TheoryPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Analyzing the limits of computation using large scale linear programming

Principal Investigator

Project Period (FY)

Research Category

Review Section

Research Institution

Developing computer-assisted methods for proving computational intractabilityPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Establishing Computer Assisted Proof Methods for Computational IntractabilityPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Practical approach to self-constructive learning on subjects on computer science

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of a New Method for Circuit Complexity Based on Large Scale Mathematical ProgramsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

生体情報処理における深層計算と表層計算に関する研究

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

論理関数の複雑さの下限導出問題に対する極限組み合わせ論的アプローチPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

オンライン予測の手法を用いた意思決定モデルに関する研究

Principal Investigator

Project Period (FY)

Amano Kazuyuki 天野一幸

AMANO Kazuyuki 天野一幸