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

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

Research Project

Project/Area Number 19500006
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeSingle-year Grants
Section一般
Research Field Fundamental theory of informatics
Research InstitutionGunma University

Principal Investigator

AMANO Kazuyuki  Gunma University, 大学院・工学研究科, 准教授 (30282031)

Project Period (FY) 2007 – 2008
Project Status Completed (Fiscal Year 2008)
Budget Amount *help
¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Fiscal Year 2008: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2007: ¥2,210,000 (Direct Cost: ¥1,700,000、Indirect Cost: ¥510,000)
Keywords回路計算量 / 下限 / 論理回路 / 論理関数 / 計算量 / 下界 / 量子回路
Research Abstract

論理回路モデルを代表とする各種計算モデルに対する, 論理関数の計算量の下限導出手法に関する研究を行った. 特に, 計算量下限導出問題を大規模数理計画問題へと帰着するアプローチについて重点的に研究を行った. その結果, 限定乱雑性を持つ論理関数に対する論理回路のサイズや, 多数決関数を近似する論理関数に対する定数段数論理回路のサイズの漸近的値を明らかにすることに成功した. 更には, 単キュービット量子回路に対して, その表現の一意性が担保される正規形の概念を提案したる.

Report

(3 results)
  • 2008 Annual Research Report   Final Research Report ( PDF )
  • 2007 Annual Research Report
  • Research Products

    (27 results)

All 2009 2008 2007 Other

All Journal Article (13 results) (of which Peer Reviewed: 13 results) Presentation (14 results)

  • [Journal Article] K-Subgraph Isomorphism on AC0 Circuit2009

    • Author(s)
      天野一幸
    • Journal Title

      Proceedings of the 24^<th> IEEE Conference on Computational Complexity (in press)

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [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)

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] k-Subgraph Isomorphism on ACO Circuits2009

    • Author(s)
      天野一幸
    • Journal Title

      Proceedings of the 24th IEEE Conference on Computational Complexity 24(in press)

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Monotone DNF Formula that has a Minimal or Maximal Number of Satisfying Assignments2008

    • Author(s)
      佐藤貴之
    • Journal Title

      Lecture Notes in Compture Science 5092

      Pages: 191-203

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Representation of Quantum Circuit with Clifford and π/ 8 Gates2008

    • Author(s)
      松本健
    • Journal Title

      Proceedings of the 8th Asian Conference on Quantum Information Science 8

      Pages: 135-136

    • Related Report
      2008 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Monotone DNF Formula that has a Minimal or Maximal Number of Satisfying Assignments2008

    • Author(s)
      佐藤 貴之
    • Journal Title

      Lecture Notes in Computer Science 5092

      Pages: 191-203

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Better Upper Bounds on the QOBDD Size of Integer Multipication2007

    • Author(s)
      天野 一幸
    • Journal Title

      Diabetes Applied Mathematics 155(10)

      Pages: 1224-1232

    • Related Report
      2007 Annual Research Report
    • Peer Reviewed
  • [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

    • Related Report
      2008 Final Research Report
    • Peer Reviewed
  • [Presentation] 最簡な論理式でNPN同値類の代表のみを生成するアルゴリズム2009

    • Author(s)
      福原秀明, 滝本英二, 天野一幸
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      東京
    • Year and Date
      2009-03-01
    • Related Report
      2008 Annual Research Report 2008 Final Research Report
  • [Presentation] 部分グラフ同型性判定の回路計算量について2008

    • Author(s)
      天野一幸
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      群馬県伊香保
    • Year and Date
      2008-12-03
    • Related Report
      2008 Final Research Report
  • [Presentation] 部分グラフ同型性判定の回路計算量について2008

    • Author(s)
      天野一幸
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      群馬県伊香保町
    • Year and Date
      2008-12-03
    • Related Report
      2008 Annual Research Report
  • [Presentation] Representation of Quantum Circuit with Clifford and π/ 8 Gates2008

    • Author(s)
      松本健
    • Organizer
      第8回量子情報科学に関するアジア会議(AQIS08)
    • Place of Presentation
      韓国・ソウル
    • Year and Date
      2008-08-17
    • Related Report
      2008 Annual Research Report
  • [Presentation] Monotone DNF Formula that has a Minimal or Maximal Number of Satisfying Assignments2008

    • Author(s)
      佐藤貴之
    • Organizer
      第14回計算と組み合わせ論に関ずる国際会議(COCOON08)
    • Place of Presentation
      中国・大連
    • Year and Date
      2008-06-29
    • Related Report
      2008 Annual Research Report
  • [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
    • Related Report
      2008 Annual Research Report
  • [Presentation] Clifford+π/8量子回路の計算能力2008

    • Author(s)
      松本健, 天野一幸
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      神奈川
    • Year and Date
      2008-03-10
    • Related Report
      2008 Final Research Report
  • [Presentation] Clifford+π/8量子回路の計算能力2008

    • Author(s)
      松本 健
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      神奈川県大和市
    • Year and Date
      2008-03-10
    • Related Report
      2007 Annual Research Report
  • [Presentation] 方形描画(フロアプラン)の個数について:厳密数え上げと下界と上界2007

    • Author(s)
      天野 一幸
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      新潟大学
    • Year and Date
      2007-11-30
    • Related Report
      2007 Annual Research Report
  • [Presentation] 方形描画の数え上げ2007

    • Author(s)
      天野一幸, 中野眞一, 山中克久
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      新潟
    • Year and Date
      2007-11-28
    • Related Report
      2008 Final Research Report
  • [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
    • Related Report
      2008 Final Research Report
  • [Presentation] A Well Mixed Function with Ciruit Complexity 5n+-o(n)2007

    • Author(s)
      垂井 淳
    • Organizer
      第10回アルゴリズムと計算に関する日韓ワークショップ
    • Place of Presentation
      韓国,光州
    • Year and Date
      2007-08-09
    • Related Report
      2007 Annual Research Report
  • [Presentation] 回路計算量の5nの下界に対する5nの上界2007

    • Author(s)
      天野一幸, 垂井淳
    • Organizer
      2007年夏のLAシンポジウム
    • Place of Presentation
      石川
    • Year and Date
      2007-07-20
    • Related Report
      2008 Final Research Report
  • [Presentation] 回路計算量の5nの下界に対する5nの上界2007

    • Author(s)
      天野 一幸
    • Organizer
      2007年夏のLAシンポジウム
    • Place of Presentation
      石川県羽咋市
    • Year and Date
      2007-07-20
    • Related Report
      2007 Annual Research Report

URL: 

Published: 2007-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi