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

UENO Kenya  上野 賢哉

ORCIDConnect your ORCID iD *help
Researcher Number 70586081
Other IDs
Affiliation (based on the past Project Information) *help 2012 – 2016: 京都大学, 学内共同利用施設等, 助教
2014: 京都大学, 白眉センター, 特定助教
2012 – 2014: 京都大学, 白眉センター, 助教
2010 – 2011: 京都大学, 次世代研究者育成センター, 助教
Review Section/Research Field
Principal Investigator
Fundamental theory of informatics / Theory of informatics
Except Principal Investigator
Theory of informatics / Science and Engineering
Keywords
Principal Investigator
計算量理論 / 線形計画法 / 論理関数 / 計算理論 / 整数計画法 / 回路計算量 / 計算限界
Except Principal Investigator
理論的性能保証 / 数理モデル化 / 情報の補填 … More / 計算困難問題 / アルゴリズム / 国際研究者交流(ベルギー・ドイツ) / 国際研究者交流:カナダ・ベルギー・チェコ・ドイツ / 多面体 / 国際研究者交流 / 計算限界 / 整数計画 / 線形計画 / 数理計画 / 国際研究者交流:カナダ・チェコ・米国 / 最適化数 / 数理計画法への応用 / 最適化 / 幾何計算 Less
  • Research Projects

    (5 results)
  • Research Products

    (32 results)
  • Co-Researchers

    (11 People)
  •  厳密算法技術による整数計画法の新展開Principal Investigator

    • Principal Investigator
      上野 賢哉
    • Project Period (FY)
      2015 – 2018
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyoto University
  •  Approximate Computing to Cope with Imperfect Information from Growing Data Size

    • Principal Investigator
      IWAMA KAZUO
    • Project Period (FY)
      2013 – 2015
    • Research Category
      Grant-in-Aid for Scientific Research (A)
    • Research Field
      Theory of informatics
    • Research Institution
      Kyoto 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
  •  New Development of Computation Theory by Exploring the Subadditive StructurePrincipal Investigator

    • Principal Investigator
      UENO Kenya
    • Project Period (FY)
      2012 – 2014
    • Research Category
      Grant-in-Aid for Young Scientists (B)
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University
  •  Clarification of Structural Complexity of FormulaPrincipal Investigator

    • Principal Investigator
      UENO Kenya
    • Project Period (FY)
      2010 – 2011
    • Research Category
      Grant-in-Aid for Research Activity Start-up
    • Research Field
      Fundamental theory of informatics
    • Research Institution
      Kyoto University

All 2015 2014 2013 2012 2011 2010 Other

All Journal Article Presentation

  • [Journal Article] Candidate Boolean Functions towards Super-Quadratic Formula Size2015

    • Author(s)
      Kenya Ueno
    • Journal Title

      IEICE Trans. Inf. & Syst.

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

    • DOI

      10.1587/transinf.2014FCP0011

    • NAID

      130004841869

    • ISSN
      0916-8532, 1745-1361
    • Language
      English
    • Peer Reviewed / Acknowledgement Compliant
    • Data Source
      KAKENHI-PROJECT-24700010
  • [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

    • Peer Reviewed / Open Access
    • Data Source
      KAKENHI-PROJECT-24700010
  • [Journal Article] 線形計画法と計算限界(小特集計算限界の解明への多面的アプローチ -P vs NP に向けた最前線-)2013

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

      電子情報通信学会会誌

      Volume: 96 Pages: 675-678

    • NAID

      110009660608

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

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

      電子情報通信学会会誌

      Volume: 96(9) Pages: 675-678

    • NAID

      110009660608

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700010
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PLANNED-24106006, KAKENHI-PROJECT-24700010, KAKENHI-PROJECT-25240002
  • [Journal Article] Formula Complexity of Ternary Majorities. In Proceedings of The 18th Annual International Computing and Combinatorics Conference2012

    • Author(s)
      Kenya Ueno
    • Journal Title

      Lecture Notes in Computer Science(Springer-Verlag)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Journal Article] Formula Complexity of Ternary Majorities2012

    • Author(s)
      Kenya Ueno
    • Journal Title

      Proceedings of COCOON 2012, Lecture Notes in Computer Science

      Volume: (掲載確定)(未確定)

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800032
  • [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

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800032, KAKENHI-PROJECT-24700010
  • [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

    • Data Source
      KAKENHI-PROJECT-24700010
  • [Journal Article] Formula Decomposition into Ternary Majorities2012

    • Author(s)
      Kenya Ueno
    • Journal Title

      数理解析研究所講究録

      Volume: 1799 Pages: 13-20

    • Data Source
      KAKENHI-PROJECT-24700010
  • [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
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-24700010, KAKENHI-PLANNED-24106006
  • [Journal Article] Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds2010

    • Author(s)
      Kenya Ueno
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 6281 Pages: 665-676

    • NAID

      110007483107

    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Journal Article] Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds. In Proceedings of The 35th International Symposium on Mathematical Foundations of Computer Science2010

    • Author(s)
      Kenya Ueno
    • Journal Title

      Lecture Notes in Computer Science 6281

      Pages: 665-676

    • DOI

      10.1007/978-3-642-15155-2_58

    • ISBN
      9783642151545, 9783642151552
    • Peer Reviewed
    • Data Source
      KAKENHI-PROJECT-22800032
  • [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
    • Invited
    • Data Source
      KAKENHI-PROJECT-24700010
  • [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
    • Data Source
      KAKENHI-PROJECT-24700010
  • [Presentation] Exact Algorithms for 0-1 Integer Programs with Linear Equality Constraints2014

    • Author(s)
      上野 賢哉
    • Organizer
      情報処理学会アルゴリズム研究会
    • Place of Presentation
      道後温泉大和屋,愛媛県松山市
    • Year and Date
      2014-06-13
    • Data Source
      KAKENHI-PROJECT-24700010
  • [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
    • Invited
    • Data Source
      KAKENHI-PLANNED-24106006
  • [Presentation] 劣加法性で横断する最適化から計算限界2013

    • Author(s)
      上野賢哉
    • Organizer
      日本オペレーションズ・リサーチ学会 第25回RAMPシンポジウム
    • Place of Presentation
      鹿児島大学
    • Invited
    • Data Source
      KAKENHI-PLANNED-24106006
  • [Presentation] 劣加法性で横断する最適化から計算限界2013

    • Author(s)
      上野 賢哉
    • Organizer
      日本オペレーションズ・リサーチ学会 第25回RAMPシンポジウム
    • Place of Presentation
      鹿児島大学
    • Invited
    • Data Source
      KAKENHI-PROJECT-24700010
  • [Presentation] 計算複雑さへの招待(3):数理計画法から攻める計算限界2013

    • Author(s)
      上野賢哉
    • Organizer
      電子情報通信学会コンピュテーション研究会
    • Place of Presentation
      奈良女子大学
    • Invited
    • Data Source
      KAKENHI-PLANNED-24106006
  • [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
    • Data Source
      KAKENHI-PROJECT-24700010
  • [Presentation] 多数決3分木への論理式分解2012

    • Author(s)
      Kenya Ueno
    • Organizer
      冬のLAシンポジウム2012
    • Place of Presentation
      京都大学(京都府)
    • Year and Date
      2012-01-30
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Presentation] 多数決3分木への論理式分解2012

    • Author(s)
      上野賢哉
    • Organizer
      冬のLAシンポジウム
    • Place of Presentation
      京都
    • Year and Date
      2012-01-30
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Presentation] Candidate Boolean Functions towards Super-Quadratic Formula Size2012

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

    • Author(s)
      Kenya Ueno
    • Organizer
      COCOON 2012
    • Place of Presentation
      Sydney, Australia
    • Year and Date
      2012-08-20
    • Data Source
      KAKENHI-PLANNED-24106006
  • [Presentation] Proof Methoods for Formula Siza Lower Bounds : Classics and Fyontier2011

    • Author(s)
      Kenya Ueno
    • Organizer
      Workshop on Proof Theory and Computability Theory
    • Place of Presentation
      Sendai, Japan(招待講演)
    • Year and Date
      2011-02-22
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Presentation] Parity versus Majority : Formula Complexity Perspective2011

    • Author(s)
      Kenya Ueno
    • Organizer
      The First AAAC Annual Meeting(AAAC2011)
    • Place of Presentation
      Hsin Chu, Taiwan
    • Year and Date
      2011-04-16
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Presentation] Proof Methods for Formula Size Lower Bounds : Classics and Frontier2011

    • Author(s)
      Kenya Ueno
    • Organizer
      Workshop on Proof Theory and Computability Theory, Iwanumaya, Akiu Spa
    • Place of Presentation
      Sendai, February
    • Year and Date
      2011-02-22
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Presentation] Parity versus Majority : Formula Complexity Perspective2011

    • Author(s)
      Kenya Ueno
    • Organizer
      The First AAAC Annual Meeting (AAAC2011)
    • Place of Presentation
      HsinChu, Taiwan
    • Year and Date
      2011-04-16
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Presentation] Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds2010

    • Author(s)
      Kenya Ueno
    • Organizer
      The 35th International Symposium on Mathematical Foundations of Computer Science
    • Place of Presentation
      Brno, Czech Republic
    • Year and Date
      2010-08-27
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Presentation] Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds2010

    • Author(s)
      Kenya Ueno
    • Organizer
      The 35th International Symposium on Mathematical Foundations of Computer Science(MFCS 2010)
    • Place of Presentation
      Brno, Czech Republic
    • Year and Date
      2010-08-27
    • Data Source
      KAKENHI-PROJECT-22800032
  • [Presentation] 計算複雑さへの招待(3):数理計画法から攻める計算限界

    • Author(s)
      上野 賢哉
    • Organizer
      電子情報通信学会 コンピュテーション研究会
    • Place of Presentation
      奈良女子大学
    • Invited
    • Data Source
      KAKENHI-PROJECT-24700010
  • 1.  Avis David (90584110)
    # of Collaborated Projects: 2 results
    # of Collaborated Products: 0 results
  • 2.  天野 一幸 (30282031)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 3.  IWAMA KAZUO (50131272)
    # 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.  ITO Hiro (50283487)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 7.  HORIYAMA Takashi (60314530)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 8.  YOSHIDA Yuichi (50636967)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 9.  OKAMOTO Kazuya (60565018)
    # of Collaborated Projects: 1 results
    # of Collaborated Products: 0 results
  • 10.  SETO Kazuhisa (20584056)
    # 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