The following pages link to Gábor Ivanyos (Q220632):
Displaying 50 items.
- On the distance between non-isomorphic groups. (Q412235) (← links)
- Splitting full matrix algebras over algebraic number fields. (Q448406) (← links)
- Quantum computation of discrete logarithms in semigroups (Q490342) (← links)
- Solving systems of diagonal polynomial equations over finite fields (Q507442) (← links)
- On the black-box complexity of Sperner's Lemma (Q839637) (← links)
- Deciding universality of quantum gates (Q876334) (← links)
- Root shadow spaces (Q881812) (← links)
- Simple Lie algebras having extremal elements (Q1005522) (← links)
- Finding the radical of matrix algebras using Fitting decompositions (Q1295786) (← links)
- Finding maximal orders in semisimple algebras over \(\mathbb{Q}\) (Q1312180) (← links)
- Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\) (Q1320439) (← links)
- Finding the radical of an algebra of linear transformations (Q1358905) (← links)
- Computing Levi decompositions in Lie algebras (Q1361007) (← links)
- Constructive non-commutative rank computation is in deterministic polynomial time (Q1630376) (← links)
- Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\) (Q1633281) (← links)
- On the complexity of trial and error for constraint satisfaction problems (Q1678168) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\) (Q1750386) (← links)
- Lattice basis reduction for indefinite forms and an application (Q1917523) (← links)
- Computing Cartan subalgebras of Lie algebras (Q1924545) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2353409) (← links)
- Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups (Q2428678) (← links)
- Root filtration spaces from Lie algebras and abstract root groups (Q2498853) (← links)
- Schemes for deterministic polynomial factoring (Q2883816) (← links)
- Finding hidden Borel subgroups of the general linear group (Q2906795) (← links)
- An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group (Q2922610) (← links)
- New bounds on the classical and quantum communication complexity of some graph properties (Q2957488) (← links)
- Generalized Wong sequences and their applications to Edmonds' problems (Q2965501) (← links)
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
- Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes (Q3434572) (← links)
- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields (Q3452558) (← links)
- Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract) (Q3454760) (← links)
- (Q3525300) (← links)
- (Q3540811) (← links)
- Hidden translation and orbit coset in quantum computing (Q3581285) (← links)
- Efficient testing of groups (Q3581388) (← links)
- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups (Q3590968) (← links)
- (Q4226940) (← links)
- (Q4238961) (← links)
- (Q4238971) (← links)
- Treating the Exceptional Cases of the MeatAxe (Q4526080) (← links)
- (Q4608047) (← links)
- Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing (Q4634059) (← links)
- Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. (Q4638110) (← links)
- (Q4762672) (← links)
- (Q4875224) (← links)
- Improved algorithms for splitting full matrix algebras (Q4929077) (← links)
- (Q5009633) (← links)
- (Q5111161) (← links)
