| Co-Investigator(Kenkyū-buntansha) |
河村 彰星 東京大学, 大学院総合文化研究科, 講師 (20600117)
垣村 尚徳 東京大学, 大学院総合文化研究科, 講師 (30508180)
小林 佑輔 筑波大学, システム情報系, 准教授 (40581591)
ロスマン ベンジャミン 国立情報学研究所, 大学共同利用機関等の部局等, 特任研究員 (90599177)
|
|---|
| Research Collaborator |
COOK Stephen トロント大学, 計算機科学部, 名誉教授
ZIEGLER Martin KAIST大学, 計算機科学部, 教授
GURVICH Vladimir ロシア国立高等経済学院, 教授
BOROS Endre ラトガース大学, 経営学部, 教授
|
|---|
| Budget Amount *help |
¥93,340,000 (Direct Cost: ¥71,800,000、Indirect Cost: ¥21,540,000)
Fiscal Year 2016: ¥19,890,000 (Direct Cost: ¥15,300,000、Indirect Cost: ¥4,590,000)
Fiscal Year 2015: ¥19,370,000 (Direct Cost: ¥14,900,000、Indirect Cost: ¥4,470,000)
Fiscal Year 2014: ¥18,850,000 (Direct Cost: ¥14,500,000、Indirect Cost: ¥4,350,000)
Fiscal Year 2013: ¥18,720,000 (Direct Cost: ¥14,400,000、Indirect Cost: ¥4,320,000)
Fiscal Year 2012: ¥16,510,000 (Direct Cost: ¥12,700,000、Indirect Cost: ¥3,810,000)
|
|---|
| Outline of Final Research Achievements |
In this project, we explore the limits of computation from mathematical logic.We obtain several results. Here we describe three instances. We show that the difference between deterministic and nondeterministic space complexity. Namely, we prove that for any k=o(log n), NC[k] is not equal to AC[k]. We also improve the nonpolynomial lower bound for monotone circuit complexity. We study weighted linear matroid parity problem which is one of the basic combinatorial optimization problems. We provide a polynomial time algorithm for the problem.
|
