The complexity of the equation solvability problem over nilpotent groups

DOI10.1016/j.jalgebra.2017.10.002zbMath1427.20039OpenAlexW2766348174MaRDI QIDQ1682080

Attila Földvári

Publication date: 28 November 2017

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2437/244317

zbMATH Keywords

equivalencecomputational complexitynilpotent groupspolynomial-time algorithmequation solvability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nilpotent groups (20F18) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Finite nilpotent groups, (p)-groups (20D15) Algebraic geometry over groups; equations over groups (20F70)

Related Items (5)

Solving a fixed number of equations over finite groups ⋮ Unnamed Item ⋮ The equation solvability problem over supernilpotent algebras with Mal’cev term ⋮ The complexity of the equation solvability and equivalence problems over finite groups ⋮ Even Faster Algorithms for CSAT Over supernilpotent Algebras.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• The complexity of solving equations over finite groups
• Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• POLYNOMIAL EQUIVALENCE OF FINITE RINGS

This page was built for publication: The complexity of the equation solvability problem over nilpotent groups