The complexity of the equation solvability problem over nilpotent groups
type: Item
instance of: scholarly article
title: The complexity of the equation solvability problem over nilpotent groups
zbMATH Open document ID: 1427.20039
author: Attila Földvári
published in: Journal of Algebra
publication date: 2017-11-28T00:00:00Z
full work available at URL: http://hdl.handle.net/2437/244317
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 20D15
Mathematics Subject Classification ID: 20F18
Mathematics Subject Classification ID: 20F70
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6813410
zbMATH Keywords: nilpotent groups
zbMATH Keywords: equation solvability
zbMATH Keywords: equivalence
zbMATH Keywords: computational complexity
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
OpenAlex ID: W2766348174
cites work: The complexity of solving equations over finite groups
cites work: POLYNOMIAL EQUIVALENCE OF FINITE RINGS
cites work: The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
cites work: THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS
cites work: The complexity of the equivalence and equation solvability problems over meta-abelian groups
cites work: THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
cites work: Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
cites work: Q4046212
cites work: Q3779765
cites work: Q3689383
DOI: 10.1016/J.JALGEBRA.2017.10.002
description: scientific article; zbMATH DE number 6813410