The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.

DOI10.1007/s00012-011-0163-yzbMath1236.16046MaRDI QIDQ652516

Gábor Horváth

Publication date: 14 December 2011

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

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

zbMATH Keywords

computational complexity; finite rings; finite nilpotent groups; equivalence problem; equation solvability problems; ring terms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

16P10: Finite rings and finite-dimensional associative algebras

16N40: Nil and nilpotent radicals, sets, ideals, associative rings

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

20D15: Finite nilpotent groups, (p)-groups

08A40: Operations and polynomials in algebraic structures, primal algebras

16Z05: Computational aspects of associative rings (general theory)

20F70: Algebraic geometry over groups; equations over groups

Related Items

The equation solvability problem over supernilpotent algebras with Mal’cev term, Unnamed Item, The complexity of the equation solvability and equivalence problems over finite groups, Loosely-abelian algebras, The complexity of the equation solvability problem over nilpotent groups, Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\)., Evaluation of polynomials over finite rings via additive combinatorics, Solving a fixed number of equations over finite groups, The complexity of the equivalence and equation solvability problems over meta-abelian groups, The complexity of the equation solvability problem over semipattern groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of equivalence for commutative rings
• Complexity of the identity checking problem for finite semigroups.
• The equivalence problem for finite rings
• Computational complexity of checking identities in 0-simple semigroups and matrix semigroups over finite fields
• Results on the equivalence problem for finite groups.
• The complexity of checking identities for finite matrix rings
• Complexity issues of checking identities in finite monoids
• THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• THE COMPLEXITY OF THE EQUIVALENCE PROBLEM OVER FINITE RINGS
• THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
• The complexity of the word-problem for finite matrix rings
• COMPLEXITY OF SEMIGROUP IDENTITY CHECKING
• The complexity of the equivalence problem for nonsolvable groups
• Varieties of groups