Gabor Horvath ; Csaba Szabo - The extended equivalence and equation solvability problems for groups

dmtcs:536 - Discrete Mathematics & Theoretical Computer Science, November 16, 2011, Vol. 13 no. 4 - https://doi.org/10.46298/dmtcs.536
The extended equivalence and equation solvability problems for groups

Authors: Gabor Horvath 1; Csaba Szabo 2

  • 1 Institute of Mathematics [Debrecen]
  • 2 Department of Algebra and Number Theory [Budapest]

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.

https://doi.org/10.46298/dmtcs.536
Source: HAL:hal-00990480v1
Volume: Vol. 13 no. 4
Published on: November 16, 2011
Accepted on: June 9, 2015
Submitted on: September 30, 2010
Keywords: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.4230/lipics.stacs.2023.4
  • 10.4230/lipics.stacs.2023.4
The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 215 times.
This article's PDF has been downloaded 165 times.