| Co-Investigator(Kenkyū-buntansha) |
脊戸 和寿 成蹊大学, 理工学部, 講師 (20584056)
玉置 卓 京都大学, 情報学研究科, 助教 (40432413)
伊藤 大雄 電気通信大学, 情報理工学(系)研究科, 教授 (50283487)
吉田 悠一 国立情報学研究所, 情報学プリンシプル研究系, 准教授 (50636967)
|
|---|
| Budget Amount *help |
¥62,140,000 (Direct Cost: ¥47,800,000、Indirect Cost: ¥14,340,000)
Fiscal Year 2016: ¥12,870,000 (Direct Cost: ¥9,900,000、Indirect Cost: ¥2,970,000)
Fiscal Year 2015: ¥13,260,000 (Direct Cost: ¥10,200,000、Indirect Cost: ¥3,060,000)
Fiscal Year 2014: ¥13,260,000 (Direct Cost: ¥10,200,000、Indirect Cost: ¥3,060,000)
Fiscal Year 2013: ¥12,740,000 (Direct Cost: ¥9,800,000、Indirect Cost: ¥2,940,000)
Fiscal Year 2012: ¥10,010,000 (Direct Cost: ¥7,700,000、Indirect Cost: ¥2,310,000)
|
|---|
| 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).
|
