How to select constraints that help algorithms approximately solve constraint satisfaction problems
| Project/Area Number |
24500011
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | University of Fukui |
|---|
Principal Investigator |
YAMAKAMI TOMOYUKI 福井大学, 工学(系)研究科(研究院), 教授 (80230324)
|
|---|
| Project Period (FY) |
2012-04-01 – 2015-03-31
|
| Project Status |
Completed (Fiscal Year 2014)
|
| Budget Amount *help |
¥5,330,000 (Direct Cost: ¥4,100,000、Indirect Cost: ¥1,230,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
|
|---|
| Keywords | 制約充足問題 / 最適化問題 / 数え上げ問題 / アルゴリズムの効率 / ＃P完全 / 対数領域計算 / プッシュダウンオートマトン / ２極値定理 / リスト行列グラフ分割問題 / 時間計算量 / プッシュダウン・オートマトン / 制約充足問題の最適解探索 / 解の数え上げ問題 / 対数領域計算可能性 / 固定長領域計算量 / リスト分割数え上げ問題 / 時間・領域計算量 / 解法アルゴリズムの効率 / 小型計算機端末 / 最適解近似アルゴリズム / 多項式時間 / 近似保存還元性 / Holant問題 / #P完全 |
|---|
| Outline of Final Research Achievements |
Constraint satisfaction problems (CSPs), which are problems of finding feasible solutions that satisfy given sets of constraints, appear frequently in daily life. By analyzing a close relationship between constraints and the efficiency of algorithms that solve those CSPs, I discovered the exact conditions on constraints to make solving algorithms faster, and this discovery helps me classify all counting Boolean CSPs according to their approximate computational complexity. As a direct application of a dichotomy theorem for counting CSPs, I successfully classified all counting list partition problems. Unlike rather theoretical polynomial-time computation, I examined logarithmic-space machine models and automata with pushdown stacks as memory devices, and explored a new frontier in a field of combinatorial optimization problems.
|
Report
(4 results)
Research Products
(29 results)
