| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2017: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2016: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2015: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2014: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Outline of Final Research Achievements |
Constraint satisfaction problems (CSPs) are fundamental combinatorial problems arising in various areas. CSPs belong to the class of NP-hard problems due to their high expressive power. In this study, we gave design and analysis of efficient exact/approximation algorithms. As a result, we obtained improved exact algorithms for systems of multi-variate polynomial equations over finite fields, the maximum satisfiability problem, the circuit satisfiability problem of bounded depth circuits with weighted symmetric gates and that of general circuits. We also obtained robust approximation algorithms for temporal CSPs.
|
