12 citations · 93 across the 29 of their papers we have counts for
5 papers · 1 filter
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…
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…
Non-commutative Edmonds' problem and matrix semi-invariants
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
In 1967, Edmonds introduced the problem of computing the rank over the rational function field of an matrix with integral homogeneous linear polynomials. In this pa…
Polynomial-time isomorphism test of groups that are tame extensions
Joshua A. Grochow, Youming Qiao
We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai,…
Sparse multivariate polynomial interpolation in the basis of Schubert polynomials
Priyanka Mukhopadhyay, Youming Qiao
Schubert polynomials were discovered by A. Lascoux and M. Schützenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomial…