Abstract.
The equivalence problem for a finite nilpotent group has polynomial time complexity, even when the terms have parameters from the group. The same result holds for the dihedral groups D n .
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received August 24, 2002; accepted in final form August 5, 2004.
Rights and permissions
About this article
Cite this article
Burris, S., Lawrence, J. Results on the equivalence problem for finite groups. Algebra univers. 52, 495–500 (2005). https://doi.org/10.1007/s00012-004-1895-8
Issue Date:
DOI: https://doi.org/10.1007/s00012-004-1895-8