The complexity of the equation solvability and equivalence problems over finite groups
From MaRDI portal
Publication:4960464
Recommendations
- The complexity of the equation solvability problem over semipattern groups
- The complexity of the equation solvability problem over nilpotent groups
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- The extended equivalence and equation solvability problems for groups
Cites work
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 534859 (Why is no real title available?)
- A Contribution to the Theory of Groups of Prime-Power Order
- Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
- Results on the equivalence problem for finite groups.
- Symbolic Collection using Deep Thought
- THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
- The complexity of solving equations over finite groups
- The complexity of the equation solvability problem over nilpotent groups
- The complexity of the equation solvability problem over semipattern groups
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- The complexity of the equivalence problem for nonsolvable groups
Cited in
(22)- Linear Diophantine Equations, Group CSPs, and Graph Isomorphism
- Equation satisfiability in solvable groups
- Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\).
- Notes on extended equation solvability and identity checking for groups
- THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS
- The complexity of equivalence and isomorphism of systems of equations over finite groups
- Dichotomies in the complexity of solving systems of equations over finite semigroups
- The complexity of the equation solvability problem over semipattern groups
- Even Faster Algorithms for CSAT Over supernilpotent Algebras.
- Complexity of modular circuits
- The extended equivalence and equation solvability problems for groups
- Solving a fixed number of equations over finite groups
- The complexity of the equation solvability problem over nilpotent groups
- The complexity of solving equations over finite groups
- Results on the equivalence problem for finite groups.
- The complexity of the equivalence problem for nonsolvable groups
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups.
- Detecting fast solvability of equations via small powerful Galois groups
- Constrained inhomogeneous spherical equations: average-case hardness
- A survey on varieties generated by small semigroups and a companion website
- Cost of equivalence relations and groups
- The complexity of the equivalence and equation solvability problems over meta-abelian groups
This page was built for publication: The complexity of the equation solvability and equivalence problems over finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960464)