• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Morizumi Hiroki  森住 大樹

ORCIDConnect your ORCID iD *help
… Alternative Names

MORIZUMI Hiroki  森住 大樹

Less
Researcher Number 50463782
Affiliation (Current) 2025: 島根大学, 学術研究院理工学系, 助教
Affiliation (based on the past Project Information) *help 2018: 島根大学, 学術研究院理工学系, 助教
2016 – 2017: 島根大学, 総合理工学研究科, 助教
2012 – 2015: 島根大学, 総合理工学研究科(研究院), 助教
2012: 島根大学, 総合理工学研究科, 助教
2010 – 2011: 島根大学, 総合理工学部, 助教
2009: Kyoto University, 情報学研究科, 特定研究員
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / Theory of informatics
Except Principal Investigator
Fundamental theory of informatics
Keywords
Principal Investigator
回路計算量 / 計算量理論 / 論理関数 / 論理回路 / 非決定性回路 / 幅限定回路 / 論理式 / 反転計算量 / 否定数限定回路
Except Principal Investigator
准線形時間 … More / 分散アルゴリズム / 乱化アルゴリズム / 劣線形時間 / 理論的性能保証 / 数理モデル化 / 情報の補填 / 計算困難問題 / アルゴリズム / 乱化計算 / アルゴリズム的ゲーム理論 / グラフ問題 / アルゴリズム理論 Less
  • Research Projects

    (4 results)
  • Research Products

    (26 results)
  • Co-Researchers

    (11 People)
  •  Establishing Circuit Complexity Theory of Nondeterministic CircuitsPrincipal Investigator

    • Principal Investigator
      Morizumi Hiroki
    • Project Period (FY)
      2015 – 2018
    • Research Category
      Grant-in-Aid for Challenging Exploratory Research
    • Research Field
      Theory of informatics
    • Research Institution
      Shimane University
  •  A Study on the Complexity of Bounded Width Boolean CircuitsPrincipal Investigator

    • Principal Investigator
      MORIZUMI Hiroki
    • Project Period (FY)
      2011 – 2014
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Shimane University
  •  Studies on Algorithms for Insufficient Spatial Information

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      2010 – 2012
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  A Study on the Complexity of Negation-Limited Boolean CircuitsPrincipal Investigator

    • Principal Investigator
      MORIZUMI Hiroki
    • Project Period (FY)
      2009 – 2011
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Shimane University
      Kyoto University

All 2019 2018 2015 2014 2013 2012 2011 2010 2009 Other

All Journal Article Presentation

  • [Journal Article] Zero-Suppression and Computation Models2018

    • Author(s)
      Hiroki Morizumi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 10979 Pages: 263-272

    • DOI

      10.1007/978-3-319-94667-2_22

    • ISBN
      9783319946665, 9783319946672
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-15K11986
  • [Journal Article] Lower Bounds for the Size of Nondeterministic Circuits2015

    • Author(s)
      Hiroki Morizumi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 9198 Pages: 289-296

    • DOI

      10.1007/978-3-319-21398-9_23

    • ISBN
      9783319213972, 9783319213989
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-15K11986
  • [Journal Article] Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions2014

    • Author(s)
      Hiroki Morizumi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8705 Pages: 104-110

    • DOI

      10.1007/978-3-662-44602-7_9

    • ISBN
      9783642387081, 9783642387098
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700020
  • [Journal Article] Complexity of Counting Output Patterns of Logic Circuits2013

    • Author(s)
      Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi and Xiao Zhou
    • Journal Title

      Conferences in Research and Practice in Information Technology

      Volume: 141

    • NAID

      110009768648

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700020
  • [Journal Article] Computing All MOD-Functions Simultaneously2012

    • Author(s)
      Evgeny Demenkov, Alexander Kulikov, Ivan Mihajlin and Hiroki Morizumi
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 7353 Pages: 81-88

    • DOI

      10.1007/978-3-642-30642-6_9

    • ISBN
      9783642306419, 9783642306426
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23700020
  • [Journal Article] Improved Approximation Algorithms for Minimum AND-Circuits Problem via k-Set Cover2011

    • Author(s)
      Hiroki Morizumi
    • Journal Title

      Information Processing Letters

      Volume: vol. 111, no. 5 Issue: 5 Pages: 218-221

    • DOI

      10.1016/j.ipl.2010.11.019

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Journal Article] Negation-Limited Inverters of Linear Size2010

    • Author(s)
      Hiroki Morizumi, and Genki Suzuki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E93-D Issue: 2 Pages: 257-262

    • DOI

      10.1587/transinf.E93.D.257

    • NAID

      10026813563

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Journal Article] Negation-Limited Inverters of Linear Size2010

    • Author(s)
      Hiroki Morizumi, Genki Suzuki
    • Journal Title

      IEICE Transactions on Information and Systems vol.E93-D

      Pages: 257-262

    • NAID

      10026813563

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Journal Article] Negation-Limited Complexity of Parity and Inverters2009

    • Author(s)
      Kazuo Iwama, Hiroki Morizumi, and Jun Tarui
    • Journal Title

      Algorithmica

      Volume: vol. 54, no. 2 Issue: 2 Pages: 256-267

    • DOI

      10.1007/s00453-007-9135-1

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Journal Article] Negation-Limited Complexity of Parity and Inverters2009

    • Author(s)
      Kazuo Iwama, Hiroki Morizumi, Jun Tarui
    • Journal Title

      Algorithmica vol.54

      Pages: 256-267

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Journal Article] Limiting Negations in Non-Deterministic Circuits2009

    • Author(s)
      Hiroki Morizumi
    • Journal Title

      Theoretical Computer Science

      Volume: vol. 410, no. 38-40 Issue: 38-40 Pages: 3988-3994

    • DOI

      10.1016/j.tcs.2009.05.018

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Journal Article] Limiting Negations in Non-Deterministic Circuits2009

    • Author(s)
      Hiroki Morizumi
    • Journal Title

      Theoretical Computer Science vol.410

      Pages: 3988-3994

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Presentation] Some Results on the Power of Nondeterministic Computation2019

    • Author(s)
      Hiroki Morizumi
    • Organizer
      2018年度冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-15K11986
  • [Presentation] Lower Bounds and Satisfiability Algorithms for Bounded Width Circuits2019

    • Author(s)
      Hiroki Morizumi
    • Organizer
      電子情報通信学会コンピュテーション研究会(2019年3月)
    • Data Source
      KAKENHI-PROJECT-15K11986
  • [Presentation] ZDDと論理式に関する一考察2018

    • Author(s)
      森住 大樹
    • Organizer
      情報処理学会 第167回アルゴリズム研究会
    • Data Source
      KAKENHI-PROJECT-15K11986
  • [Presentation] On Zero-Suppressed Binary Decision Diagrams and Complexity Theory2014

    • Author(s)
      Hiroki Morizumi
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      崇城大学(熊本県)
    • Year and Date
      2014-12-05
    • Data Source
      KAKENHI-PROJECT-23700020
  • [Presentation] On Computing Sensitivity, Block Sensitivity, and Certificate Complexity for Boolean Formulas2014

    • Author(s)
      Hiroki Morizumi
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      中央大学(東京都)
    • Data Source
      KAKENHI-PROJECT-23700020
  • [Presentation] Complexity of Counting Output Patterns of Logic Circuits2013

    • Author(s)
      Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi and Xiao Zhou
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      小樽商科大学(小樽市)
    • Data Source
      KAKENHI-PROJECT-23700020
  • [Presentation] Complexity of Counting Output Patterns of Logic Circuits2013

    • Author(s)
      Kei Uchizawa, Zhenghong Wang, Hiroki Morizumi and Xiao Zhou
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      小樽商科大学(北海道)
    • Data Source
      KAKENHI-PROJECT-23700020
  • [Presentation] Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions2013

    • Author(s)
      Hiroki Morizumi
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      沖縄産業支援センター(沖縄県)
    • Data Source
      KAKENHI-PROJECT-23700020
  • [Presentation] Limiting Negations in Probabilistic Circuits2012

    • Author(s)
      森住大樹
    • Organizer
      2011年度冬のLAシンポジウム
    • Place of Presentation
      京都大学(京都府)
    • Year and Date
      2012-01-31
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Presentation] Computing All MOD-Functions Simultaneously2012

    • Author(s)
      Evgeny Demenkov, Alexander S. Kulikov,Ivan Mihajlin, Hiroki Morizumi
    • Organizer
      CSR
    • Place of Presentation
      Nizhny Novgorod, Russia
    • Year and Date
      2012-07-06
    • Data Source
      KAKENHI-PROJECT-22240001
  • [Presentation] Limiting Negations in Probabilistic Circuits2012

    • Author(s)
      森住 大樹
    • Organizer
      2011年度 冬のLAシンポジウム
    • Place of Presentation
      京都大学(京都府)
    • Year and Date
      2012-01-31
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Presentation] Limiting Negations in Formulas2009

    • Author(s)
      Hiroki Morizumi
    • Organizer
      the 36th International Colloquium on Automata, Languages and Programming
    • Place of Presentation
      ロードス(ギリシャ)
    • Year and Date
      2009-07-09
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Presentation] Limiting Negations in Formulas2009

    • Author(s)
      Hiroki Morizumi
    • Organizer
      The 36th International Colloquium on Automata, Languages and Programming (ICALP 2009)
    • Place of Presentation
      ロードス(ギリシャ)
    • Year and Date
      2009-07-09
    • Data Source
      KAKENHI-PROJECT-21700002
  • [Presentation] 幅限定回路と段数限定論理式に対する単純な#SATアルゴリズム

    • Author(s)
      森住 大樹
    • Organizer
      2014年度 冬のLAシンポジウム
    • Place of Presentation
      京都大学(京都府)
    • Year and Date
      2015-01-28 – 2015-01-30
    • Data Source
      KAKENHI-PROJECT-23700020
  • 1.  ITO Hiro (50283487)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 2.  IWAMA Kazuo (50131272)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 3.  AVIS David (90584110)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 4.  MIYAZAKI Shuichi (00303884)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 5.  TAMAKI Suguru (40432413)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 6.  KATOH Naoki (40145826)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 7.  TOKUYAMA Takeshi (40312631)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 8.  YAMASHITA Masafumi (00135419)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 9.  WATANABE Osamu (80158617)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 10.  HORIYAMA Takashi (60314530)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 11.  KAWAHARA Jun (20572473)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results

URL: 

Are you sure that you want to link your ORCID iD to your KAKEN Researcher profile?
* This action can be performed only by the researcher himself/herself who is listed on the KAKEN Researcher’s page. Are you sure that this KAKEN Researcher’s page is your page?

この研究者とORCID iDの連携を行いますか?
※ この処理は、研究者本人だけが実行できます。

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi