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

Iwamoto Chuzo  岩本 宙造

ORCIDConnect your ORCID iD *help
… Alternative Names

岩本 宙造  イワモト チユウゾウ

IWAMOTO Chuzo  岩本 宙造

Less
Researcher Number 60274495
Other IDs
External Links
Affiliation (Current) 2026: 広島大学, 先進理工系科学研究科(工), 教授
Affiliation (based on the past Project Information) *help 2023 – 2024: 広島大学, 先進理工系科学研究科(工), 教授
2020 – 2021: 広島大学, 先進理工系科学研究科(工), 教授
2017 – 2019: 広島大学, 工学研究科, 教授
2016: 広島大学, 工学研究院, 教授
2014 – 2015: 広島大学, 工学(系)研究科(研究院), 教授 … More
2011 – 2013: 広島大学, 工学(系)研究科(研究院), 准教授
2009 – 2010: 広島大学, 大学院・工学研究院, 准教授
2007 – 2009: Hiroshima University, 大学院・工学研究科, 准教授
2005 – 2006: 広島大学, 大学院工学研究科, 助教授
2004: 広島大学, 大学院・工学研究科, 助教授
2001 – 2002: 広島大学, 大学院・工学研究科, 助教授
1997 – 2001: 広島大学, 工学部, 助教授
1996: Kyushu Institute of Design, Lecturer, 講師
1995: 九州芸術工科大学, 芸術工学部, 講師 Less
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / 計算機科学 / Basic Section 60010:Theory of informatics-related / Theory of informatics
Except Principal Investigator
計算機科学
Keywords
Principal Investigator
計算複雑さ / 計算量理論 / システム評価 / セルオートマトン / 階層定理 / 計算の複雑さ / 論理設計 / 一様論理回路族 / 非決定性計算 / 計算機モデル … More / チューリング機械 / 加速定理 / 論理最適化システム / 領域計算量 / 時間計算量 / 美術館定理 / 計算複雑性 / 並列ランダムアクセス機械 / 交代性チューリング機械 / CAD / 論理合成システム / イテラティブアレイ / 自動設計システム / システム性能評価 / 時間複雑さ / 対数時間一様 / 計算量の階層 / 論理回路族 / 回路計算量 … More
Except Principal Investigator
PVM / CAD / 充足可能性問題 / bit reversal permutation / queue size / randomization / adaptation / oblivious routing / permutation routing / mesh computers / コンパクトラウティング / ラウティングテーブル / ラウティング / メッシュ計算機 / 2次元メッシュネットワーク / ビット反転置換 / キューサイズ / 確率化 / 適応化 / 無情報ラウティング / 全置換ラウティング / メッシュ型計算機 / vectorization / parallelization / local search algorithms / student assignment / Partial MAXSAT / CNF Satisfiability / real-world problems / NP完全性 / 組合せ問題 / SAT / 多項式時間変換 / 最適化問題 / ベクトル化 / 並列化 / 局所探索アルゴリズム / 学生配属問題 / 部分MAXSAT / 実世界問題 / random generation / benchmarks / optimization / logic design / 回路理論的複雑さ / オンセットサイズ / 等価変換 / 入出力次数制限 / NANDゲート回路 / 論理回路最適化システム / ベンチマーク生成システム / ランダム論理回路 / ランダム生成 / ベンチマーク / 最適化 / 論理設計 / Security of instance generation / Computational complexity / Read-once resolution / Propositional proof system / Weighting strategy / Local search / Control of the number of solutions / Satisfiability problem / 例題生成系の安全性 / 計算複雑さ / 単読導出原理 / 定理自動証明 / 重みつけ法 / 局所探索法 / 充足解数の制御 Less
  • Research Projects

    (12 results)
  • Research Products

    (83 results)
  • Co-Researchers

    (9 People)
  •  無線LAN環境を考慮した美術館定理の証明と人工建築物や自然地形への応用Principal Investigator

    • Principal Investigator
      岩本 宙造
    • Project Period (FY)
      2023 – 2027
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Review Section
      Basic Section 60010:Theory of informatics-related
    • Research Institution
      Hiroshima University
  •  Hierarchical results on complexity classes and methods for evaluating logic synthesis systemsPrincipal Investigator

    • Principal Investigator
      Iwamoto Chuzo
    • Project Period (FY)
      2016 – 2021
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Theory of informatics
    • Research Institution
      Hiroshima University
  •  Studies on hierarchies of complexity classes and its application to new evaluation methods for circuit design systemsPrincipal Investigator

    • Principal Investigator
      IWAMOTO Chuzo
    • Project Period (FY)
      2011 – 2016
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Hiroshima University
  •  Proof of hierarchies on circuit complexities based on size and depth, and its application to evaluation of automated design systemsPrincipal Investigator

    • Principal Investigator
      IWAMOTO Chuzo
    • Project Period (FY)
      2007 – 2010
    • Research Category
      Grant-in-Aid for Scientific Research (C)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Hiroshima University
  •  計算複雑さに基づく関数集合の階級付けと論理設計ツールの評価法の確立Principal Investigator

    • Principal Investigator
      岩本 宙造
    • Project Period (FY)
      2004 – 2006
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Hiroshima University
  •  論理回路族の階層性の証明と論理合成CADシステムの評価への応用Principal Investigator

    • Principal Investigator
      岩本 宙造
    • Project Period (FY)
      2001 – 2002
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      計算機科学
    • Research Institution
      Hiroshima 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
      Hiroshima University
  •  Development of fast routing algorithms using adaptation and randomization

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      1998 – 2000
    • Research Category
      Grant-in-Aid for Scientific Research on Priority Areas (B)
    • Research Institution
      Kyoto 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
      Hiroshima University
  •  Solving Real-World Combinatorial Problems using High-Speed SAT-Algorithms

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      1997 – 1999
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      計算機科学
    • Research Institution
      KYOTO UNIVERSITY
  •  Fast and Mass Generation of Random Benchmark Circuits That Are Not Too Artificial

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      1996 – 1997
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      計算機科学
    • Research Institution
      KYOTO UNIVERSITY
      Kyushu University
  •  Research on Random Generation of Test Instances with Controlled Attributes.

    • Principal Investigator
      IWAMA Kazuo
    • Project Period (FY)
      1995 – 1996
    • Research Category
      Grant-in-Aid for Scientific Research (B)
    • Research Field
      計算機科学
    • Research Institution
      KYUSHU UNIVERSITY

All 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2005 2004 Other

All Journal Article Presentation

  • [Journal Article] Computational Complexity of Yajisan-Kazusan and Stained Glass2025

    • Author(s)
      IWAMOTO Chuzo、TAKAISHI Ryo
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E108.D Issue: 3 Pages: 201-207

    • DOI

      10.1587/transinf.2024FCP0004

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2025-03-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Journal Article] Choco Banana is NP-Complete2024

    • Author(s)
      IWAMOTO Chuzo、TOKUNAGA Takeru
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E107.A Issue: 9 Pages: 1488-1491

    • DOI

      10.1587/transfun.2023DML0001

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2024-09-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Journal Article] Chained Block is NP-Complete2024

    • Author(s)
      IWAMOTO Chuzo、IDE Tatsuya
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E107.D Issue: 3 Pages: 320-324

    • DOI

      10.1587/transinf.2023FCL0001

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2024-03-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Journal Article] Computational Complexity of Sukoro2023

    • Author(s)
      岩本 宙造、小田 涼香
    • Journal Title

      電子情報通信学会論文誌D 情報・システム

      Volume: J106-D Issue: 5 Pages: 357-361

    • DOI

      10.14923/transinfj.2022JDL8010

    • ISSN
      1880-4535, 1881-0225
    • Year and Date
      2023-05-01
    • Language
      Japanese
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Journal Article] Computational Complexity of the Vertex-to-Point Conflict-Free Chromatic Art Gallery Problem2023

    • Author(s)
      IWAMOTO Chuzo、IBUSUKI Tatsuaki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E106.D Issue: 9 Pages: 1499-1506

    • DOI

      10.1587/transinf.2022EDP7222

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2023-09-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Journal Article] Moon-or-Sun, Nagareru, and Nurimeizu are NP-complete2022

    • Author(s)
      Chuzo Iwamoto、Tatsuya Ide
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E105.A Pages: 1-8

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Five Cells and Tilepaint are NP-Complete2022

    • Author(s)
      IWAMOTO Chuzo、IDE Tatsuya
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E105.D Issue: 3 Pages: 508-516

    • DOI

      10.1587/transinf.2021FCP0001

    • NAID

      130008165595

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2022-03-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard2022

    • Author(s)
      Iwamoto Chuzo、Ibusuki Tatsuaki
    • Journal Title

      Lecture Notes in Computer Science, Springer-Verlag

      Volume: 13174 Pages: 111-122

    • DOI

      10.1007/978-3-030-96731-4_10

    • ISBN
      9783030967307, 9783030967314
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Chromatic Art Gallery Problem with r-visibility is NP-complete2021

    • Author(s)
      Chuzo Iwamoto, Tatsuaki Ibusuki
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      Volume: E104-A Pages: 1-8

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Computational Complexity of Two Pencil Puzzles: Kurotto and Juosan2021

    • Author(s)
      Iwamoto Chuzo、Ibusuki Tatsuaki
    • Journal Title

      Lecture Notes in Computer Science, Springer-Verlag

      Volume: 13034 Pages: 175-185

    • DOI

      10.1007/978-3-030-90048-9_14

    • ISBN
      9783030900472, 9783030900489
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Computational Complexity of Nurimisaki and Sashigane2020

    • Author(s)
      IWAMOTO Chuzo、IDE Tatsuya
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E103.A Issue: 10 Pages: 1183-1192

    • DOI

      10.1587/transfun.2019DMP0002

    • NAID

      130007920259

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2020-10-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons2020

    • Author(s)
      Iwamoto Chuzo、Ibusuki Tatsuaki
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 12049 Pages: 146-157

    • DOI

      10.1007/978-3-030-39881-1_13

    • ISBN
      9783030398804, 9783030398811
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles2020

    • Author(s)
      Chuzo Iwamoto and Tatsuya Ibusuki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E103.D Issue: 3 Pages: 500-505

    • DOI

      10.1587/transinf.2019FCP0004

    • NAID

      130007804165

    • ISSN
      0916-8532, 1745-1361
    • Year and Date
      2020-03-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Computational Complexity of Herugolf and Makaro2019

    • Author(s)
      Chuzo Iwamoto, Masato Haruishi, and Tatsuya Ibusuki
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E102.A Issue: 9 Pages: 1118-1125

    • DOI

      10.1587/transfun.E102.A.1118

    • NAID

      130007699568

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2019-09-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Dosun-Fuwari is NP-complete2018

    • Author(s)
      Chuzo Iwamoto and Tatsuaki Ibusuki
    • Journal Title

      Journal of Information Processing

      Volume: 26 Issue: 0 Pages: 358-361

    • DOI

      10.2197/ipsjjip.26.358

    • NAID

      130006707935

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Computational Complexity of Usowan Puzzles2018

    • Author(s)
      Chuzo Iwamoto and Masato Haruishi
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E101.A Issue: 9 Pages: 1537-1540

    • DOI

      10.1587/transfun.E101.A.1537

    • NAID

      130007479526

    • ISSN
      0916-8508, 1745-1337
    • Year and Date
      2018-09-01
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-Hard2017

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E100.D Issue: 7 Pages: 1521-1525

    • DOI

      10.1587/transinf.2016EDL8251

    • NAID

      130006792955

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Finding the Minimum Number of Open-Edge Guards in an Orthogonal Polygon is NP-hard2017

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E100-D

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] NP-completeness of Mojipittan2017

    • Author(s)
      岩本宙造,春石聖人
    • Journal Title

      電子情報通信学会論文誌D 情報・システム

      Volume: J100-D Issue: 12 Pages: 974-977

    • DOI

      10.14923/transinfj.2017JDL8016

    • ISSN
      1880-4535, 1881-0225
    • Year and Date
      2017-12-01
    • Language
      Japanese
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Journal Article] Computational Complexity of Building Puzzles2016

    • Author(s)
      Chuzo Iwamoto and Yuta Matsui
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E99.A Issue: 6 Pages: 1145-1148

    • DOI

      10.1587/transfun.E99.A.1145

    • NAID

      130005154236

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018, KAKENHI-PROJECT-16K00020
  • [Journal Article] Visibility Problems for Manhattan Towers2016

    • Author(s)
      Chuzo Iwamoto and Yusuke Kitagaki
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E99.D Issue: 3 Pages: 607-614

    • DOI

      10.1587/transinf.2015FCP0007

    • NAID

      130005131813

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Computational Complexity of Generalized Forty Thieves2015

    • Author(s)
      Chuzo Iwamoto and Yuta Matsui
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E98.D Issue: 2 Pages: 429-432

    • DOI

      10.1587/transinf.2014EDL8154

    • NAID

      130004841843

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Computational Complexity of Generalized Golf Solitaire2015

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E98.D Issue: 3 Pages: 541-544

    • DOI

      10.1587/transinf.2014FCL0001

    • NAID

      130004841874

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Computational Complexity of the r-visibility Guard Set Problem for Polyominoes2014

    • Author(s)
      Chuzo Iwamoto and Toshihiko Kume
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8845 Pages: 87-95

    • DOI

      10.1007/978-3-319-13287-7_8

    • ISBN
      9783319132860, 9783319132877
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Yosenabe is NP-complete2014

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      Journal of Information Processing

      Volume: 22 Issue: 1 Pages: 40-43

    • DOI

      10.2197/ipsjjip.22.40

    • NAID

      130003394447

    • ISSN
      1882-6652
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Generalized Pyramid is NP-Complete2013

    • Author(s)
      Chuzo Iwamoto and Yuta Matsui
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E96.D Issue: 11 Pages: 2462-2465

    • DOI

      10.1587/transinf.E96.D.2462

    • NAID

      130003385408

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication2013

    • Author(s)
      M. Villagra, M. Nakanishi, S. Yamashita, and Y. Nakashima
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E96.D Issue: 1 Pages: 1-8

    • DOI

      10.1587/transinf.E96.D.1

    • NAID

      10031167374

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-21700016, KAKENHI-PROJECT-22500009, KAKENHI-PROJECT-23240001, KAKENHI-PROJECT-23500018, KAKENHI-PROJECT-24500003, KAKENHI-PLANNED-24106009
  • [Journal Article] Generalized Shisen-Sho is NP-Complete2012

    • Author(s)
      Chuzo Iwamoto, Yoshihiro Wada, and Kenichi Morita
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E95.D Issue: 11 Pages: 2712-2715

    • DOI

      10.1587/transinf.E95.D.2712

    • NAID

      10031142898

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Lower Bound of Face Guards of Polyhedral Terrains2012

    • Author(s)
      Chuzo Iwamoto, Junichi Kishi, and Kenichi Morita
    • Journal Title

      Journal of Information Processing

      Volume: 20 Pages: 435-437

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] 多面体テラインの面警備員数の上下限の改善2012

    • Author(s)
      岩本宙造,蔵信卓己
    • Journal Title

      電子情報通信学会論文誌D-I

      Volume: J95-D Pages: 1869-1872

    • NAID

      110009517646

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Lower Bound of Face Guards of Polyhedral Terrains2012

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      Journal of Information Processing

      Volume: 53 Pages: 1-4

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] A Polynomial-Time Reduction from the 3SAT Problem to the Generalized String Puzzle Problem2012

    • Author(s)
      Chuzo Iwamoto, Kento Sasaki, and Kenichi Morita
    • Journal Title

      Algorithms

      Volume: Vol.5, No.2 Issue: 2 Pages: 261-272

    • DOI

      10.3390/a5020261

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014, KAKENHI-PROJECT-23500018
  • [Journal Article] Lower Bound of Face Guards of Polyhedral Terrains2012

    • Author(s)
      Chuzo Iwamoto, Junichi Kishi, and Kenichi Morita
    • Journal Title

      Journal of Information Processing(JIP)

      Volume: Vol.20, No.2 Pages: 435-437

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] Finding the Minimum Number of Face Guards is NP-Hard2012

    • Author(s)
      Chuzo Iwamoto, Yusuke Kitagaki, and Kenichi Morita
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E95.D Issue: 11 Pages: 2716-2719

    • DOI

      10.1587/transinf.E95.D.2716

    • NAID

      10031142899

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] A Polynomial-Time Reduction from the SAT Problem to the Generalized One-Person Last-and-First Game2011

    • Author(s)
      Chuzo Iwamoto and Yusuke Sumida
    • Journal Title

      Advances in Computer Science and Engineering

      Volume: Vol.6, No.2 Pages: 105-114

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] A Polynomial-Time Reduction from the SAT Problem to the Generalized One-Person Last-and-First Game2011

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      Advances in Computer Science and Engineering

      Volume: 6 Pages: 105-114

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] 非決定性回路族における深さと非決定性ゲート数の関係2011

    • Author(s)
      岩本宙造
    • Journal Title

      情報処理学会論文誌

      Volume: 52 Pages: 1667-1677

    • NAID

      110008507999

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] 非決定性回路族における深さと非決定性ゲート数の関係2011

    • Author(s)
      岩本宙造,小野優介,森田憲一,今井克暢
    • Journal Title

      情報処理学会論文誌

      Volume: 52 Pages: 1667-1677

    • NAID

      110008507999

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] A Polynomial-Time Reduction from the SAT Problem to the Generalized One-Person Last-and-First Game2011

    • Author(s)
      Chuzo Iwamoto and Yusuke Sumida
    • Journal Title

      Advances in Computer Science and Engineering

      Volume: 6 Pages: 105-114

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Journal Article] Relationship between Depth and Nondeterministic Gates in Nondeterministic Circuit Families2011

    • Author(s)
      Chuzo Iwamoto, Yusuke Ono, Kenichi Morita, and Katsunobu Imai
    • Journal Title

      IPSJ Journal

      Volume: Vol.52, No.4 Pages: 1667-1677

    • NAID

      110008507999

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] NP-Hard and k-EXPSPACE-Hard Cast Puzzles2010

    • Author(s)
      Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, and Kenichi Morita
    • Journal Title

      IEICE Trans. Inf. & Syst.

      Volume: E93-D Issue: 11 Pages: 2995-3004

    • DOI

      10.1587/transinf.E93.D.2995

    • NAID

      10027988361

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] A Tight Space-Hierarchy Theorem for Nondeterministic Turing Machines2010

    • Author(s)
      Chuzo Iwamoto, Daisuke Tachibana, Seiki Tokunaga, and Kenichi Morita
    • Journal Title

      The Transactions of the Institute of Electronics, In for mation and Communication Engineers D-I

      Volume: Vol.J93-D, No.9 Pages: 1717-1726

    • NAID

      110007700685

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] NP-hard and k-EXPSPACE-hard Cast Puzzles2010

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E93-D Pages: 295-3004

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] 非決定性チューリング機械の厳密な領域階層定理2010

    • Author(s)
      岩本宙造
    • Journal Title

      電子情報通信学会論文誌D-I

      Volume: J93-D Pages: 1717-1726

    • NAID

      110007700685

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] An Efficient Reconstruction Algorithm for Restricted Domino Tilings2009

    • Author(s)
      Chuzo Iwamoto, Reijiro Mikamo
    • Journal Title

      The Transactions of the Institute of Electronics, Information and Communication Engineers D-I Vol. J92-D, No. 6(in Japanese)

      Pages: 758-766

    • NAID

      110007328880

    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] 段数を制限したドミノタイリングの効率良い再構成アルゴリズム2009

    • Author(s)
      岩本宙造
    • Journal Title

      電子情報通信学会論文誌D-I

      Volume: J92-D Pages: 758-766

    • NAID

      110007328880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] On the Non-existence of Rotation-Symmetric von Neumann Neighbor Number-Conserving Cellular Automata of which the State Number is Less than Four2009

    • Author(s)
      Naonori Tanimoto, Katsunobu Imai, Chuzo Iwamoto, and Kenichi Morita
    • Journal Title

      IEICETransactions on Information and Systems

      Volume: Vol.E92-D, No.2 Pages: 255-257

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] Computational Complexity of Cast Puzzles2009

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      Proceedings of the 20th International Symposiumon Algorithms and Computation (Lecture Notes in Computer Science)?

      Volume: 5878 Pages: 122-131

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] An Efficient Reconstruction Algorithm for Restricted Domino Tilings2009

    • Author(s)
      Chuzo Iwamoto and Reijiro Mikamo
    • Journal Title

      The Transactions of the Institute of Electronics, Information and Communication Engineers D-I

      Volume: Vol.J92-D, No.6 Pages: 758-766

    • NAID

      110007328880

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] A Recursive Padding Technique on Nondeterministic Cellular Automata2008

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E91-A(9)

      Pages: 2335-2340

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] A Recursive Padding Technique on Nondeterministic Cellular Automata2008

    • Author(s)
      Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
    • Journal Title

      IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Vol. E91-A, No. 9

      Pages: 2335-2340

    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] A Recursive Padding Technique on Nondeterministic Cellular Automata2008

    • Author(s)
      Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, and Katsunobu Imai
    • Journal Title

      IEICE Trans. Fundamentals

      Volume: E91-A Issue: 9 Pages: 2335-2340

    • DOI

      10.1093/ietfec/e91-a.9.2335

    • NAID

      10026851419

    • ISSN
      0916-8508, 1745-1337
    • Language
      English
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] A Five-State von Neumann Neighbor Universal Hyperbolic Cellular Automaton2007

    • Author(s)
      Katsunobu Imai, Chuzo Iwamoto, and Kenichi Morita
    • Journal Title

      Journal of Cellular Automata

      Volume: Vol.1, No.4 Pages: 275-297

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] Translational Lemmas for DLOGTIME-uniform Circuits, Alternating TMs, and PRAMs2007

    • Author(s)
      Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai
    • Journal Title

      Acta Informatica Vol. 44, No. 5

      Pages: 345-359

    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] Translational Lemmas for DLOGTIME-uniform Circuits, Alternating TMs, and PRAMs2007

    • Author(s)
      Chuzo Iwamoto, Naoki Hatayama, Yoshiaki Nakashiba, Kenichi Morita, and Katsunobu Imai
    • Journal Title

      Acta Informatica

      Volume: Vol.44, No.5 Issue: 5 Pages: 345-359

    • DOI

      10.1007/s00236-007-0051-2

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] A Time Hierarchy Theorem for Nondeterministic Cellular Automata2007

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      Proc. 4th Ann. Conf. on Theory and Applications of Models of Computation, (Lecture Notes in Computer Science) 4484

      Pages: 511-520

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] Translational Lemmas for DLOGTIME-uniform Circuits, Alternating TMs, and PRAMs2007

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      Acta Informatica 44

      Pages: 345-359

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Journal Article] Translational Lemmas for Alternating TMs and PRAMs2005

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      Lecture Notes in Computer Science 3623

      Pages: 126-137

    • Data Source
      KAKENHI-PROJECT-16700015
  • [Journal Article] Hierarchies of DLOGTIME-Uniform Circuits2004

    • Author(s)
      Chuzo Iwamoto
    • Journal Title

      M.Margenstern (ed.): Machines, Computations and Universality (Proc.MCU2004). Lecture Notes in Computer Science 3354

      Pages: 211-222

    • Data Source
      KAKENHI-PROJECT-16700015
  • [Journal Article] A Tight Space-Hierarchy Theorem for Nondeterministic Turing Machines

    • Author(s)
      Chuzo Iwamoto, Daisuke Tachibana, Seiki Tokunaga, Kenichi Morita
    • Journal Title

      The Transactions of the Institute of Electronics, Information and Communication Engineers D-I (to appear)

    • NAID

      110007700685

    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] The Chromatic Dispersive Art Gallery Problem2024

    • Author(s)
      Chuzo Iwamoto and Shun Takahashi
    • Organizer
      The 26th Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG3)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Presentation] ステンドグラスパズルに対するカードを用いたゼロ知識証明プロトコル2024

    • Author(s)
      吉塚創也,岩本宙造,櫻井幸一
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Presentation] 知恵の輪の計算複雑性2024

    • Author(s)
      早川和郎,岩本宙造
    • Organizer
      2024年度(第75回)電気・情報関連学会中国支部連合大会
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Presentation] 多角形に対する辺警備員配置問題2023

    • Author(s)
      髙橋駿,岩本宙造
    • Organizer
      電気・情報関連学会中国支部連合大会
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Presentation] Yajisan-Kazusan and Stained Glass are NP-complete2023

    • Author(s)
      Chuzo Iwamoto and Ryo Takaishi
    • Organizer
      23rd Japan-Korea Joint Workshop on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-23K10987
  • [Presentation] Vertex-to-Point Conflict-Free Chromatic Guarding is NP-hard2022

    • Author(s)
      Chuzo Iwamoto
    • Organizer
      The 16th International Conference and Workshops on Algorithms and Computation
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Presentation] Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons2020

    • Author(s)
      岩本宙造
    • Organizer
      冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Presentation] Moon-or-Sun, Nagareru, and Nurimeizu are NP-complete2020

    • Author(s)
      井出達也,岩本宙造
    • Organizer
      冬のLAシンポジウム
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Presentation] Nurimisaki and Sashigane are NP-complete2019

    • Author(s)
      Chuzo Iwamoto
    • Organizer
      The 31st Canadian Conference on Computational Geometry
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Presentation] Herugolf and Makaro are NP-complete2018

    • Author(s)
      Chuzo Iwamoto
    • Organizer
      The Ninth International Conference on Fun with Algorithms (FUN 2018)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Presentation] Kurotto and Juosan are NP-complete2018

    • Author(s)
      Chuzo Iwamoto
    • Organizer
      The 21st Japan Conference on Discrete and Computational Geometry, Graphs, and Games (JCDCG^3 2018)
    • Int'l Joint Research
    • Data Source
      KAKENHI-PROJECT-16K00020
  • [Presentation] Locating the Minimum Number of Guards with r-visibility in a Polyomino is NP-hard2013

    • Author(s)
      Chuzo Iwamoto and Toshihiko Kume
    • Organizer
      The 16th Japan Conference on Discrete and Computational Geometry and Graphs
    • Place of Presentation
      Tokyo
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Presentation] Universal von Neumann Neighborhood Cellular Automata on Penrose Tilings2013

    • Author(s)
      Kota Sato, Katsunobu Imai, and Chuzo Iwamoto
    • Organizer
      The 1st International Workshop on Applications and Fundamentals of Cellular Automata
    • Place of Presentation
      Matsuyama
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Presentation] Computational Complexity of String Puzzles2012

    • Author(s)
      Chuzo Iwamoto
    • Organizer
      18th Computing: the Australasian Theory Symposium (CATS 2012)
    • Place of Presentation
      Melbourne, Australia
    • Data Source
      KAKENHI-PROJECT-23500018
  • [Presentation] Computational Complexity of String Puzzles2012

    • Author(s)
      Chuzo Iwamoto
    • Organizer
      Proceedings of the 18th Computing : the Australasian Theory Symposium
    • Place of Presentation
      オーストラリア・メルボルン
    • Year and Date
      2012-02-01
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] Computational Complexity of String Puzzles2012

    • Author(s)
      Chuzo Iwamoto, Kento Sasaki, and Kenichi Morita
    • Organizer
      Proceedings of the 18th Computing : the Australasian Theory Symposium(CATS 2012)
    • Place of Presentation
      Melbourne, Australia, CRPIT, 128, Mestre, J. Eds., ACS.(2012)
    • Year and Date
      2012-02-01
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] A Note on Tatami Tilings2010

    • Author(s)
      Artiom Alhazov, 森田憲一, 岩本宙造
    • Organizer
      RIMS研究集会(京都大学数理解析研究所講究録)
    • Place of Presentation
      京都市
    • Year and Date
      2010-02-01
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] Computational Complexity of Cast Puzzles2009

    • Author(s)
      Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
    • Organizer
      Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009) (Lecture Notes in Computer Science 5878)
    • Place of Presentation
      Hawaii(発表)
    • Year and Date
      2009-12-16
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] Computational Complexity of Cast Puzzles2009

    • Author(s)
      Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, and Kenichi Morita
    • Organizer
      Proceedings of the 20th International Symposium on Algorithms and Computation(ISAAC2009)
    • Place of Presentation
      Hawaii, USA
    • Year and Date
      2009-12-16
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] "On Designing Gliders in Three-Dimensional Larger than Life Cellular Automata2009

    • Author(s)
      Katsunobu Imai, Yasuaki Masamori, Chuzo Iwamoto, and Kenichi Morita
    • Organizer
      in F. Peper et al.(eds.): Natural Computing(Proceedings in Information and Communications Technology)
    • Place of Presentation
      Himeji, Japan
    • Year and Date
      2009-09-24
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] 段数5の単色ドミノタイリングの直交射影からの再構成2008

    • Author(s)
      岩本宙造
    • Organizer
      冬のLAシンポジウム
    • Place of Presentation
      京都市
    • Year and Date
      2008-01-29
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] A Time Hierarchy Theorem for Nondeterministic Cellular Automata2007

    • Author(s)
      Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, and Katsunobu Imai
    • Organizer
      Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation
    • Place of Presentation
      Shanghai, China
    • Year and Date
      2007-05-25
    • Data Source
      KAKENHI-PROJECT-19500014
  • [Presentation] A Time Hierarchy Theorem for Nondeterministic Cellular Automata2007

    • Author(s)
      Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
    • Organizer
      Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (Lecture Notes in Computer Science 4484)
    • Place of Presentation
      Shanghai, China(発表)
    • Year and Date
      2007-05-25
    • Data Source
      KAKENHI-PROJECT-19500014
  • 1.  IWAMA Kazuo (50131272)
    # of Collaborated Projects: 4 results
    # of Collaborated Products: 0 results
  • 2.  MIYANO Eiji (10284548)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 3.  OKABE Yasuo (20204018)
    # of Collaborated Projects: 3 results
    # of Collaborated Products: 0 results
  • 4.  SAWADA Sunao (70235464)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 5.  SAKURAI Kouichi (60264066)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 6.  OGINO Hiroyuki (40144323)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 7.  YASUOKA Koichi (20230211)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 8.  MIYAZAKI Shuichi (00303884)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 9.  KAWAKUBO Kazuo (10186067)
    # 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