| Budget Amount *help |
¥20,410,000 (Direct Cost: ¥15,700,000、Indirect Cost: ¥4,710,000)
Fiscal Year 2016: ¥3,640,000 (Direct Cost: ¥2,800,000、Indirect Cost: ¥840,000)
Fiscal Year 2015: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2014: ¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2013: ¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2012: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
|
|---|
| 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.
|
