Pages that link to "Item:Q2577706"
From MaRDI portal
The following pages link to Results on the equivalence problem for finite groups. (Q2577706):
Displaying 17 items.
- Identity checking problem for transformation monoids (Q444673) (← links)
- The complexity of the equivalence and equation solvability problems over nilpotent rings and groups. (Q652516) (← links)
- Complexity of the identity checking problem for finite semigroups. (Q843593) (← links)
- Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264) (← links)
- An assertion concerning functionally complete algebras and NP-completeness (Q955041) (← links)
- Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\). (Q1934970) (← links)
- Some results on equivalence groups (Q1952864) (← links)
- The complexity of the equivalence and equation solvability problems over meta-abelian groups (Q2343499) (← links)
- Complexity issues of checking identities in finite monoids (Q2655464) (← links)
- The complexity of the equation solvability problem over semipattern groups (Q2986663) (← links)
- THE EQUIVALENCE PROBLEM OVER FINITE RINGS (Q3006615) (← links)
- The complexity of the equation solvability and equivalence problems over finite groups (Q4960464) (← links)
- Satisfiability in MultiValued Circuits (Q5080482) (← links)
- COLLAPSING WORDS: A PROGRESS REPORT (Q5483371) (← links)
- A survey on varieties generated by small semigroups and a companion website (Q6051037) (← links)
- Equation satisfiability in solvable groups (Q6614610) (← links)
- Complexity of modular circuits (Q6649462) (← links)