Proof of hierarchies on circuit complexities based on size and depth, and its application to evaluation of automated design systems
Project/Area Number |
19500014
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Fundamental theory of informatics
|
Research Institution | Hiroshima University |
Principal Investigator |
IWAMOTO Chuzo 広島大学, 大学院・工学研究院, 准教授 (60274495)
|
Project Period (FY) |
2007 – 2010
|
Project Status |
Completed (Fiscal Year 2010)
|
Budget Amount *help |
¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2010: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2009: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2008: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2007: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
|
Keywords | 計算の複雑さ / 計算量理論 / 計算複雑さ / 階層定理 / 論理設計 / システム評価 / 計算機モデル / 非決定性計算 / セルオートマトン |
Research Abstract |
If we are allowed to use more computational resources such as space and time, then we should be able to recognize more languages or compute more difficult functions. This property is theoretically proved by the hierarchy theorems. In this research, we have presented hierarchy theorems based on uniform circuit families, Turing machines, cellular automata, and parallel random access machines. These hierarchy theorems imply the existence of functions which separate computational complexity classes.
|
Report
(6 results)
Research Products
(37 results)
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Computational Complexity of String Puzzles2012
Author(s)
Chuzo Iwamoto, Kento Sasaki, and Kenichi Morita
Organizer
Proceedings of the 18th Computing : the Australasian Theory Symposium(CATS 2012)
Place of Presentation
Melbourne, Australia, CRPIT, 128, Mestre, J. Eds., ACS.(2012)
Year and Date
2012-02-01
Related Report
-
-
-
-
[Presentation] Computational Complexity of Cast Puzzles2009
Author(s)
Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, and Kenichi Morita
Organizer
Proceedings of the 20th International Symposium on Algorithms and Computation(ISAAC2009)
Place of Presentation
Hawaii, USA
Year and Date
2009-12-16
Related Report
-
[Presentation] Computational Complexity of Cast Puzzles2009
Author(s)
Chuzo Iwamoto, Kento Sasaki, Kenji Nishio, Kenichi Morita
Organizer
Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC 2009) (Lecture Notes in Computer Science 5878)
Place of Presentation
Hawaii(発表)
Year and Date
2009-12-16
Related Report
-
-
-
-