Research on Approximation Algorithms for Satisfiable Constraint Satisfaction Problems
| Project/Area Number |
26730009
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | National Institute of Informatics |
|---|
Principal Investigator |
Yoshida Yuichi 国立情報学研究所, 情報学プリンシプル研究系, 准教授 (50636967)
|
|---|
| Project Period (FY) |
2014-04-01 – 2017-03-31
|
| Project Status |
Completed (Fiscal Year 2016)
|
| Budget Amount *help |
¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2016: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2015: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2014: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
|
|---|
| Keywords | 制約充足問題 / 近似アルゴリズム / 性質検査 / 近似困難性 / 高階フーリエ解析 |
|---|
| Outline of Final Research Achievements |
The constraint satisfaction problem is a problem in which a set of variables and a set of constraints are given and the goal is assigning values to variables so that all the constraints are satisfied. In this research, in order to give approximation algorithms and approximation hardness of satisfiable constraint satisfaction problems, we studied its algebraic structure. Especially, we focused on a framework called property testing, which is used to derive approximation hardness of constraint satisfaction problems. As a result, we succeeded in deriving the necessary and sufficient condition of algebraic properties that can be tested in constant time and the necessary and sufficient condition of a constraint satisfaction problem for which the satisfiability of an assignment can be tested in constant time.
|
Report
(4 results)
Research Products
(35 results)
