Studies on Limits of Computation via Information and Coding Theory

2016 Fiscal Year Final Research Report

• Project Area: A multifaceted approach toward understanding the limitations of computation
• Project/Area Number: 24106003
• 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: National Institute of Informatics
• Principal Investigator: Kawarabayashi Kenichi 国立情報学研究所, 情報学プリンシプル研究系, 教授 (40361159)
• Co-Investigator(Kenkyū-buntansha): 脊戸 和寿 成蹊大学, 理工学部, 講師 (20584056) ; 玉置 卓 京都大学, 情報学研究科, 助教 (40432413) ; 伊藤 大雄 電気通信大学, 情報理工学(系)研究科, 教授 (50283487) ; 吉田 悠一 国立情報学研究所, 情報学プリンシプル研究系, 准教授 (50636967)
• Project Period (FY): 2012-06-28 – 2017-03-31
• Keywords: 計算理論

Outline of Final Research Achievements

We make progress in the study on limits of computation by exploiting　and developing state of the art techniques in discrete mathematics　such as　information and coding theory.　More concretely, we obtain the following results:　(1) resolution of various analogous problems to the P vs. NP problem, including a characterization of constant time testability of properties in sub-linear time computation and separations of Boolean circuit classes,　(2) fine-grained complexity analysis of fundamental computational　problems concerning graphs and constraint satisfaction problems, including a world record polynomial time approximation algorithm for the 3 coloring problem, and　(3) Applications of sub-linear time computation and graph algorithms to the areas such as machine learning and big data processing, based on the results of (1)(2).

Free Research Field

計算機理論