5 citations · 5 across the 5 of their papers we have counts for
1 paper · 1 filter
Akihiro Yabe
The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmu…