Computational Complexity in Analysis and Geometry
Project/Area Number |
23700009
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Multi-year Fund |
Research Field |
Fundamental theory of informatics
|
Research Institution | The University of Tokyo |
Principal Investigator |
|
Project Period (FY) |
2011-04-28 – 2015-03-31
|
Project Status |
Completed (Fiscal Year 2014)
|
Budget Amount *help |
¥4,290,000 (Direct Cost: ¥3,300,000、Indirect Cost: ¥990,000)
Fiscal Year 2013: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2012: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2011: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
Keywords | 計算量 / 数値計算 / 計算可能解析 / 計算可能解析学 / 帰納解析学 |
Outline of Final Research Achievements |
(1) Foundation of computational complexity in mathematical analysis using type-two complexity and theory of representations (2) Computational complexity of problems involving analytic functions and some slightly larger classes of functions
|
Report
(5 results)
Research Products
(14 results)
-
-
[Journal Article] The distance 4-sector of two points is unique2013
Author(s)
R. Fraser, M. He, A. Kawamura, A. López-Ortiz, J. I. Munro, P. K. Nicholson
-
Journal Title
Proc. Twenty-Fourth International Symposium on Algorithms and Computation (ISAAC)
Volume: LNCS 8283
Pages: 612-622
DOI
ISBN
9783642450297, 9783642450303
Related Report
Peer Reviewed
-
-
-
-
-
-
-
-
[Presentation] 連続系の計算量
Author(s)
河村彰星
Organizer
新学術領域研究「計算限界解明」計算量理論秋学校
Place of Presentation
長野県北佐久郡軽井沢町
Related Report
Invited
-
-
-
-