Analyzing the limits of computation using large scale linear programming

2016 Fiscal Year Final Research Report

• Project Area: A multifaceted approach toward understanding the limitations of computation
• Project/Area Number: 24106006
• Research Category: Grant-in-Aid for Scientific Research on Innovative Areas (Research in a proposed research area)
• Allocation Type: Single-year Grants
• Review Section: Science and Engineering
• Research Institution: Kyoto University
• Principal Investigator: Avis David 京都大学, 情報学研究科, 特定教授 (90584110)
• Co-Investigator(Kenkyū-buntansha): 天野 一幸 群馬大学, その他部局等, 教授 (30282031) ; 上野 賢哉 京都大学, 学内共同利用施設等, 助教 (70586081)
• Project Period (FY): 2012-06-28 – 2017-03-31
• Keywords: 幾何計算 / 最適化 / 数理計画法への応用

Outline of Final Research Achievements

The mission of the B02 group was to use mathematical programming based methods to attack the P vs NP problem. The most powerful tool in mathematical programming is linear programming (LP), with which truly enormous problems can be solved to optimality in a reasonable amount of time.Therefore, studying the complexity of LP and LP formulations is a powerful tool in the study of the P vs NP problem. The two main tools we employed in our attack on this problem are extension complexity and communication complexity.With a team of 3 domestic and 6 international researchers we did research on 7 areas withing this field. This resulted in 20 papers of which 16 appear in refereed journals and 3 are under review.We also produced 8 papers which appear in conference proceedings.

Free Research Field

最適化