| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2017: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2016: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2015: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Outline of Final Research Achievements |
The aim of this research is to investigate the complexity of various hard problems in combinatorics. We treat such a problem as a particular instance of NP problem, and try to develop the framework that can discuss the complexity of a particular instance instead of the usual worst case scenario. We apply an approach that combines the computer experiments and theoretical arguments, which is a unique feature of this research. As a result, we have succeeded to make large progress on various problems especially that appeared in the computational complexity theory. We published 7 papers and gave 14 presentations during this work.
|
