Skip to main content
SpringerLink
Log in

Results on the equivalence problem for finite groups

  • Original Paper
  • Published:
algebra universalis Aims and scope Submit manuscript

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 .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Dept. of Pure Mathematics, University of Waterloo, Waterloo, Ont., Canada, N2L 3G1

    Stanley Burris & J. Lawrence

Authors
  1. Stanley Burris
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Lawrence
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stanley Burris.

Additional information

Received August 24, 2002; accepted in final form August 5, 2004.

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00012-004-1895-8

Mathematics Subject Classification (2000).

Key words and phrases.

Search

Navigation