| Budget Amount *help |
¥12,480,000 (Direct Cost: ¥9,600,000、Indirect Cost: ¥2,880,000)
Fiscal Year 2019: ¥2,470,000 (Direct Cost: ¥1,900,000、Indirect Cost: ¥570,000)
Fiscal Year 2018: ¥3,510,000 (Direct Cost: ¥2,700,000、Indirect Cost: ¥810,000)
Fiscal Year 2017: ¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2016: ¥3,380,000 (Direct Cost: ¥2,600,000、Indirect Cost: ¥780,000)
|
|---|
| Outline of Final Research Achievements |
In this research project we developed new techniques based on algebraic complexity theory to solve problems from theoretical computer science. Our main achievements are as follows.
We first developed new approaches to solve algebraic problems, and constructed faster algorithms for rectangular matrix multiplication. We then showed how to apply in a novel way algebraic techniques to several problems from computer science. In particular, via this approach we designed fast distributed algorithms for various computational problems over networks. Finally, we designed several quantum algorithms for graph problems that are faster than the best known algorithms.
|
