The complexity of the equation solvability problem over semipattern groups

DOI10.1142/S0218196717500126zbMath1368.20034arXiv1603.05788MaRDI QIDQ2986663

Attila Földvári

Publication date: 16 May 2017

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.05788

zbMATH Keywords

equivalencecomputational complexitypolynomial time algorithmmatrix ringsnilpotent ringspattern groupsequation solvabilitysemipattern groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear algebraic groups over finite fields (20G40) Nil and nilpotent radicals, sets, ideals, associative rings (16N40) Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

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 ⋮ Evaluation of polynomials over finite rings via additive combinatorics

Cites Work

• Unnamed Item
• The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
• The complexity of equivalence for commutative rings
• The complexity of solving equations over finite groups
• The complexity of the equivalence and equation solvability problems over meta-abelian groups
• The equivalence problem for finite rings
• Counting characters of upper triangular groups.
• Results on the equivalence problem for finite groups.
• 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 equivalence problem for nonsolvable groups
• Supercharacters and superclasses for algebra groups

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