The extended equivalence and equation solvability problems for groups - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

The extended equivalence and equation solvability problems for groups

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.
Fichier principal
Vignette du fichier
2051-6593-1-PB.pdf (276.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990480 , version 1 (13-05-2014)

Identifiers

Cite

Gabor Horvath, Csaba Szabo. The extended equivalence and equation solvability problems for groups. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 4 (4), pp.23--32. ⟨10.46298/dmtcs.536⟩. ⟨hal-00990480⟩

Collections

TDS-MACS
44 View
759 Download

Altmetric

Share

Gmail Facebook X LinkedIn More