2016 Fiscal Year Final Research Report
On Algorithmic Approaches to Proving Circuit Lower Bounds
| Project/Area Number |
26730007
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Seikei University |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2014-04-01 – 2017-03-31
|
| Keywords | 計算量理論 / 充足可能性問題 / 回路計算量 / 閾値回路 |
|---|
| 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.
|
| Free Research Field |
情報学基礎理論
|
