New Development of Computation Theory by Exploring the Subadditive Structure

2014 Fiscal Year Final Research Report

• Project/Area Number: 24700010
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Fundamental theory of informatics
• Research Institution: Kyoto University
• Principal Investigator: UENO Kenya 京都大学, 白眉センター, 助教 (70586081)
• Project Period (FY): 2012-04-01 – 2015-03-31
• 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.

Free Research Field

計算の基礎理論