The extended equivalence and equation solvability problems for groups

@article{Horvth2011TheEE,
  title={The extended equivalence and equation solvability problems for groups},
  author={G{\'a}bor Horv{\'a}th and Csaba A. Szab{\'o}},
  journal={Discrete Mathematics & Theoretical Computer Science},
  year={2011},
  volume={13},
  pages={23-32}
}
The algorithmic aspects of the equivalence problem and the equation solvability problem have received increasing attention in the past two decades. The equivalence problem for a finite algebra A asks whether or not two (term or polynomial) expressions s and t are equivalent over A (denoted by A |= s ≈ t), i.e. if s and t determine the same function over A. The equation solvability is one of the oldest problems of algebra: it asks whether or not two (term or polynomial) expressions s, t can… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Reducibility Among Combinatorial Problems

Complexity of Computer Computations • 1972
View 4 Excerpts
Highly Influenced

Engelsche elemente noetherscher gruppen

R. Baer
Math. Ann., • 1957
View 4 Excerpts
Highly Influenced

Results on the equivalence problem for finite groups

S. Burris, J. Lawrence
Alg. Univ., • 2004
View 3 Excerpts
Highly Influenced

Equivalence and equation solvability problems for the groupA4

G. Horváth, Cs. Szabó
J. Pure Appl. Algebra, • 2011
View 2 Excerpts

Similar Papers

Loading similar papers…