Constructive non-commutative rank computation is in deterministic polynomial time

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam. Constructive non-commutative rank computation is in deterministic polynomial time. Computational Complexity, 27(4):561-593, 2018. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.