The complexity of the equation solvability and equivalence problems over finite groups
DOI10.1142/S0218196720500137zbMath1484.20056OpenAlexW2988191270WikidataQ114614797 ScholiaQ114614797MaRDI QIDQ4960464
Attila Földvári, Gábor Horváth
Publication date: 16 April 2020
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196720500137
equivalencecomputational complexitypolynomial time algorithmsemidirect product of groupsequation solvability
Analysis of algorithms and problem complexity (68Q25) Finite abelian groups (20K01) 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 (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- The complexity of the equation solvability problem over nilpotent 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
- Results on the equivalence problem for finite groups.
- The complexity of the equation solvability problem over semipattern groups
- THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
- Symbolic Collection using Deep Thought
- A Contribution to the Theory of Groups of Prime-Power Order
- The complexity of the equivalence problem for nonsolvable groups
This page was built for publication: The complexity of the equation solvability and equivalence problems over finite groups