| 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)
|
|---|
| 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.
|
