32 citations · 157 across the 38 of their papers we have counts for
6 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…
Computing explicit isomorphisms with full matrix algebras over
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
We propose a polynomial time -algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over ) for computing an isomorphism (i…
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…
On solving systems of diagonal polynomial equations over finite fields
Gabor Ivanyos, Miklos Santha
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of eq…
Polynomial Interpolation and Identity Testing from High Powers over Finite Fields
Gabor Ivanyos, Marek Karpinski, Miklos Santha +2
We consider the problem of recovering (that is, interpolating) and identity testing of a "hidden" monic polynomial , given an oracle access to for (…