| Budget Amount *help |
¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,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,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Outline of Final Research Achievements |
P versus NP problem is the most important problem in theoretical computer science. Our ultimate goal is to solve this problem. Toward this goal, we study on the connection between fast satisfiability algorithms and circuit complexity. In this research, we gave the first algorithm that solves the satisfiability problem of constant depth circuits with a few symmetric gates. It runs faster than brute force search. In addition, we gave a new algorithm for the maximum satisfiability problems.
|
