Complexities of determinant and permanent computations characterize respectively the classes GapL and GapP. This suggests that computing permanent is much harder than computing determinant, however, there exists no proof yet. In this talk, I will survey previous attempts to prove above, and describe a new approach to the problem.
