Studies on efficient exact and approximation algorithms for constraint satisfaction problems
| Project/Area Number |
26330011
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Kyoto University |
|---|
Principal Investigator |
Tamaki Suguru 京都大学, 情報学研究科, 助教 (40432413)
|
|---|
| Project Period (FY) |
2014-04-01 – 2018-03-31
|
| Project Status |
Completed (Fiscal Year 2017)
|
| 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)
|
|---|
| Keywords | 厳密アルゴリズム / 近似アルゴリズム / 計算困難 / 制約充足問題 / 充足可能性問題 |
|---|
| 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.
|
Report
(5 results)
Research Products
(32 results)
