A Study on the Complexity of Bounded Width Boolean Circuits
Project/Area Number |
23700020
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
Fundamental theory of informatics
|
Research Institution | Shimane University |
Principal Investigator |
MORIZUMI Hiroki 島根大学, 総合理工学研究科(研究院), 助教 (50463782)
|
Project Period (FY) |
2011-04-28 – 2015-03-31
|
Project Status |
Completed (Fiscal Year 2014)
|
Budget Amount *help |
¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2013: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Fiscal Year 2012: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
Keywords | 計算量理論 / 回路計算量 / 論理回路 / 論理関数 / 幅限定回路 |
Outline of Final Research Achievements |
We studied bounded width Boolean circuits to explore the circuit complexity. In this study, Boolean circuits are considered as a mathematical model of computation, and studied from the viewpoint of computational complexity theory, on the background that there are many open problems of computational complexity such as the P vs. NP problem. As the conclusion, we obtained several results for Boolean circuits and Boolean functions.
|
Report
(5 results)
Research Products
(9 results)