Group:Student Seminar
Title: Randomized Communication Complexity of Matrix Inversion
Speaker: Chengu Wang University
Time: 2011-11-15 16:00-2011-11-15 17:00
Venue: FIT 1-222

Abstract:

In my talk in the theory lunch two weeks ago, I proved the randomized communication complexity of determinant. However, I don't know how to solve the matrix inversion problem. In this talk, I will tell you my ideal on the inversion problem. None of communication complexity knowledge is required, because I will only talk in maths. If you are good at maths, maybe you can help me to solve it.