Gábor Horváth

Affiliations:
  • University of Debrecen, Institute of Mathematics, Hungary


According to our database1, Gábor Horváth authored at least 8 papers between 2006 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
The complexity of the equation solvability and equivalence problems over finite groups.
Int. J. Algebra Comput., 2020

Congruence preserving expansions of nilpotent algebras.
Int. J. Algebra Comput., 2020

2017
The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs.
Int. J. Algebra Comput., 2017

2015
Length of polynomials over finite groups.
J. Comput. Syst. Sci., 2015

2012
On Free Algebras in Varieties Generated by Iterated Semidirect Products of Semilattices.
Int. J. Algebra Comput., 2012

2011
The extended equivalence and equation solvability problems for groups.
Discret. Math. Theor. Comput. Sci., 2011

2008
An assertion concerning functionally complete algebras and NP-completeness.
Theor. Comput. Sci., 2008

2006
The Complexity of Checking Identities over Finite Groups.
Int. J. Algebra Comput., 2006


  Loading...