12 citations · 33 across the 15 of their papers we have counts for
Showing 2015 · cs.CCShow all
2 papers · 2 filters
cs.CC2015★ 12 cited
Constructive noncommutative rank computation is in deterministic polynomial time
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
We extend our techniques developed in our earlier paper appeared in Computational Complexity, 2017 (preprint: arXiv:1508.00690) to obtain a deterministic polynomial time algorithm…
cs.CC2015★ 8 cited
On generating the ring of matrix semi-invariants
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
For a field , let be the ring of invariant polynomials for the action of on tuples of matrices…