Discrete Mathematics & Theoretical Computer Science, Vol 13, No 4

Font Size:  Small  Medium  Large

The extended equivalence and equation solvability problems for groups

Gábor Horváth, Csaba Szabó

Abstract


We prove that the extended equivalence problem is solvable in polynomial time for finite nilpotent groups, and coNP- complete, otherwise. We prove that the extended equation solvability problem is solvable in polynomial time for finite nilpotent groups, and NP-complete, otherwise.

Full Text: PDF PostScript