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

New Development of Computation Theory by Exploring the Subadditive Structure

Research Project

Project/Area Number 24700010
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeMulti-year Fund
Research Field Fundamental theory of informatics
Research InstitutionKyoto University

Principal Investigator

UENO Kenya  京都大学, 白眉センター, 助教 (70586081)

Project Period (FY) 2012-04-01 – 2015-03-31
Project Status Completed (Fiscal Year 2014)
Budget Amount *help
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2014: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Keywords計算量理論 / 線形計画法 / 整数計画法 / 論理関数 / 計算理論
Outline of Final Research Achievements

In this research project, we have aimed at creating a new current in the theory of computatoin from harmonized view of algorithms and computational complexity theory by focusing on subadditive structures which appear in both of them. Consequently, we have made progress on some research topics such as proof methos for formula-size lower bounds, exact exponential algorithms for integer programs and analysis of polyhedral structure of integer programs from the harmonized view.

Report

(4 results)
  • 2014 Annual Research Report   Final Research Report ( PDF )
  • 2013 Research-status Report
  • 2012 Research-status Report
  • Research Products

    (15 results)

All 2015 2014 2013 2012 Other

All Journal Article (8 results) (of which Peer Reviewed: 6 results,  Open Access: 1 results,  Acknowledgement Compliant: 1 results) Presentation (7 results) (of which Invited: 3 results)

  • [Journal Article] Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory2015

    • Author(s)
      Kenya Ueno
    • Journal Title

      Interdisciplinary Information Sciences, Tohoku University

      Volume: 印刷中

    • NAID

      110009992969

    • Related Report
      2014 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Candidate Boolean Functions towards Super-Quadratic Formula Size2015

    • Author(s)
      Kenya Ueno
    • Journal Title

      IEICE Transactions on Information and Systems

      Volume: E98.D Issue: 3 Pages: 524-531

    • DOI

      10.1587/transinf.2014FCP0011

    • NAID

      130004841869

    • ISSN
      0916-8532, 1745-1361
    • Related Report
      2014 Annual Research Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds2013

    • Author(s)
      Kenya Ueno
    • Journal Title

      International Journal of Foundations of Computer Science

      Volume: 24 Issue: 08 Pages: 1339-1354

    • DOI

      10.1142/s0129054113500378

    • NAID

      110007483107

    • Related Report
      2013 Research-status Report
    • Peer Reviewed
  • [Journal Article] 線形計画法と計算限界(小特集 計算限界の解明への多面的アプローチ ―P vs NPに向けた最前線―)2013

    • Author(s)
      上野 賢哉
    • Journal Title

      電子情報通信学会会誌

      Volume: 96(9) Pages: 675-678

    • NAID

      110009660608

    • Related Report
      2013 Research-status Report
    • Peer Reviewed
  • [Journal Article] A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints2012

    • Author(s)
      Kenya Ueno
    • Journal Title

      Theoretical Computer Science

      Volume: Vol.434 Pages: 87-97

    • DOI

      10.1016/j.tcs.2012.02.005

    • NAID

      120004057191

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Formula Complexity of Ternary Majorities2012

    • Author(s)
      Kenya Ueno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 7434 Pages: 434-444

    • DOI

      10.1007/978-3-642-32241-9_37

    • ISBN
      9783642322402, 9783642322419
    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Candidate Boolean Functions towards Super-Quadratic Formula Size2012

    • Author(s)
      Kenya Ueno
    • Journal Title

      IEICE Technical Report

      Volume: 112 (93) Pages: 49-55

    • NAID

      110009588451

    • Related Report
      2012 Research-status Report
  • [Journal Article] Formula Decomposition into Ternary Majorities2012

    • Author(s)
      Kenya Ueno
    • Journal Title

      数理解析研究所講究録

      Volume: 1799 Pages: 13-20

    • Related Report
      2012 Research-status Report
  • [Presentation] Exact Algorithms for 0-1 Integer Programs with Linear Equality Constraints2014

    • Author(s)
      Kenya Ueno
    • Organizer
      ELC Mini-Workshop on Boolean Functions
    • Place of Presentation
      計算限界研究センター,東京都港区
    • Year and Date
      2014-11-06
    • Related Report
      2014 Annual Research Report
  • [Presentation] Exact Algorithms for 0-1 Integer Programs with Linear Equality Constraints2014

    • Author(s)
      上野 賢哉
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      道後温泉大和屋,愛媛県松山市
    • Year and Date
      2014-06-13
    • Related Report
      2014 Annual Research Report
  • [Presentation] Inapproximability of Linear Programs for the Universal Relation2014

    • Author(s)
      Kenya Ueno
    • Organizer
      ELC Workshop on Inapproximability
    • Place of Presentation
      The University of Electro-Communications
    • Related Report
      2013 Research-status Report
    • Invited
  • [Presentation] 劣加法性で横断する最適化から計算限界2013

    • Author(s)
      上野 賢哉
    • Organizer
      日本オペレーションズ・リサーチ学会 第25回RAMPシンポジウム
    • Place of Presentation
      鹿児島大学
    • Related Report
      2013 Research-status Report
    • Invited
  • [Presentation] Candidate Boolean Functions towards Super-Quadratic Formula Size2012

    • Author(s)
      Kenya Ueno
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      北海道大学
    • Related Report
      2012 Research-status Report
  • [Presentation] Formula Complexity of Ternary Majorities2012

    • Author(s)
      Kenya Ueno
    • Organizer
      The 18th Annual International Computing and Combinatorics Conference (COCOON 2012)
    • Place of Presentation
      Sydney, Australia
    • Related Report
      2012 Research-status Report
  • [Presentation] 計算複雑さへの招待(3):数理計画法から攻める計算限界

    • Author(s)
      上野 賢哉
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Place of Presentation
      奈良女子大学
    • Related Report
      2013 Research-status Report
    • Invited

URL: 

Published: 2013-05-31   Modified: 2019-07-29  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi