Gábor Ivanyos

According to our database1, Gábor Ivanyos authored at least 51 papers between 1993 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing.
SIAM J. Comput., 2019

Explicit equivalence of quadratic forms over Fq(t).
Finite Fields Their Appl., 2019

Discrete logarithm and Diffie-Hellman problems in identity black-box groups.
CoRR, 2019

2018
On the complexity of trial and error for constraint satisfaction problems.
J. Comput. Syst. Sci., 2018

Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x).
Foundations of Computational Mathematics, 2018

Chevalley-Warning Theorem in Quantum Computing.
ERCIM News, 2018

Constructive non-commutative rank computation is in deterministic polynomial time.
Computational Complexity, 2018

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields.
Algorithmica, 2018

On Learning Linear Functions from Subset and Its Applications in Quantum Computing.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Solving systems of diagonal polynomial equations over finite fields.
Theor. Comput. Sci., 2017

Irreducibility and deterministic r-th root finding over finite fields.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Irreducibility and r-th root finding over finite fields.
CoRR, 2017

Non-commutative Edmonds' problem and matrix semi-invariants.
Computational Complexity, 2017

On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz.
Proceedings of the 32nd Computational Complexity Conference, 2017

2016
Explicit equivalence of quadratic forms over $\mathbb{F}_q(t)$.
CoRR, 2016

2015
Generalized Wong sequences and their applications to Edmonds' problems.
J. Comput. Syst. Sci., 2015

Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics.
CoRR, 2015

On generating the ring of matrix semi-invariants.
CoRR, 2015

Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$.
CoRR, 2015

2014
Hidden Translation and Translating Coset in Quantum Computing.
SIAM J. Comput., 2014

Polynomial time quantum algorithms for certain bivariate hidden polynomial problems.
Quantum Information & Computation, 2014

Quantum computation of discrete logarithms in semigroups.
J. Mathematical Cryptology, 2014

An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Hidden Symmetry Subgroup Problems.
SIAM J. Comput., 2013

2012
Finding hidden Borel subgroups of the general linear group.
Quantum Information & Computation, 2012

On the distance between non-isomorphic groups.
Eur. J. Comb., 2012

Deterministic Polynomial Factoring and Association Schemes.
Electronic Colloquium on Computational Complexity (ECCC), 2012

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.
Algorithmica, 2012

New bounds on the classical and quantum communication complexity of some graph properties.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011
Splitting full matrix algebras over algebraic number fields
CoRR, 2011

2009
On the Black-Box Complexity of Sperner's Lemma.
Theory Comput. Syst., 2009

Deterministic Polynomial Time Algorithms for Matrix Completion Problems.
Electronic Colloquium on Computational Complexity (ECCC), 2009

2008
Constructions for quantum computing with symmetrized gates.
Quantum Information & Computation, 2008

On solving systems of random linear disequations.
Quantum Information & Computation, 2008

Schemes for Deterministic Polynomial Factoring.
Electronic Colloquium on Computational Complexity (ECCC), 2008

Trading GRH for algebra: algorithms for factoring polynomials and related structures.
Electronic Colloquium on Computational Complexity (ECCC), 2008

2007
Root shadow spaces.
Eur. J. Comb., 2007

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups.
Proceedings of the STACS 2007, 2007

2006
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005
Efficient testing of groups.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2003
Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem.
Int. J. Found. Comput. Sci., 2003

Hidden translation and orbit coset in quantum computing.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2000
Treating the Exceptional Cases of the MeatAxe.
Experimental Mathematics, 2000

Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract).
Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1997
Computing Levi Decompositions in Lie algebras.
Appl. Algebra Eng. Commun. Comput., 1997

Polynomial Time Algorithms for Modules over Finite Dimensional Algebras.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996
Lattice basis reduction for indefinite forms and an application.
Discret. Math., 1996

Computing Cartan subalgebras of Lie algebras.
Appl. Algebra Eng. Commun. Comput., 1996

Multiplicative Equations over Commuting Matrices.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1994
Decomposition of Algebras over Fq(X1, ..., Xm).
Appl. Algebra Eng. Commun. Comput., 1994

1993
Finding Maximal Orders in Semisimple Algebras Over Q.
Computational Complexity, 1993


  Loading...