2017 Fiscal Year Final Research Report
Theory and applications of complexity theory for continuous systems
| Project/Area Number |
26700001
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (A)
|
| Allocation Type | Partial Multi-year Fund |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Kyushu University (2017)
The University of Tokyo (2014-2016) |
|---|
Principal Investigator |
|
|---|
| Project Period (FY) |
2014-04-01 – 2018-03-31
|
| Keywords | 計算量 / 計算可能性 / 実数計算 / 実効的解析学 / 精度保証 / 微分方程式 |
|---|
| Outline of Final Research Achievements |
Polynomial-time computability and other fundamental notions of computational complexity play a central role in discrete algorithm design and analysis. In this project we explored (further) extensions of such notions to problems involving continuous data. Some of the concepts and techniques that had been known to work at the level of computability were successfully refined to give practically meaningful analysis of time- and space-bounded computation.
|
| Free Research Field |
計算量理論
|
