activity
20062026
most citedConstructive noncommutative rank computation is in deterministic polynomial time

12 citations · 33 across the 15 of their papers we have counts for

collaborators
Showing 2019 · math.RTShow all

Nothing from them under that filter.

Their other years and fields are still on the left.