Solving a fixed number of equations over finite groups
type: Item
instance of: scholarly article
title: Solving a fixed number of equations over finite groups
zbMATH Open document ID: 1498.20078
author: Philipp Nuspl
published in: Algebra Universalis
publication date: 2021-02-09T00:00:00Z
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 13P15
Mathematics Subject Classification ID: 20F70
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7308304
zbMATH Keywords: polynomial equations
zbMATH Keywords: equation solvability
zbMATH Keywords: computational complexity
zbMATH Keywords: semidirect products
MaRDI profile type: MaRDI publication profile
full work available at URL: s00012-020-00701-6
OpenAlex ID: W3119220626
cites work: Q5092435
cites work: Combinatorial Nullstellensatz
cites work: Q4536353
cites work: The complexity of the equation solvability problem over semipattern groups
cites work: The complexity of the equation solvability problem over nilpotent groups
cites work: The complexity of the equation solvability and equivalence problems over finite groups
cites work: The complexity of solving equations over finite groups
cites work: The complexity of problems connected with two-element algebras
cites work: Q4650358
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: Intermediate problems in modular circuits satisfiability
cites work: Q4230829
DOI: 10.1007/S00012-020-00701-6
description: scientific article; zbMATH DE number 7308304