Pages that link to "Item:Q3421602"

The following pages link to THE COMPLEXITY OF CHECKING IDENTITIES OVER FINITE GROUPS (Q3421602):

Displaying 19 items.

• Loosely-abelian algebras (Q292836) (← links)
• 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)
• An assertion concerning functionally complete algebras and NP-completeness (Q955041) (← links)
• The complexity of the equation solvability problem over nilpotent groups (Q1682080) (← links)
• Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\). (Q1934970) (← links)
• Solving a fixed number of equations over finite groups (Q2226983) (← 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)
• TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS (Q3067781) (← links)
• The equation solvability problem over supernilpotent algebras with Mal’cev term (Q4687481) (← links)
• The complexity of the equation solvability and equivalence problems over finite groups (Q4960464) (← links)
• Expressive Power, Satisfiability and Equivalence of Circuits over Nilpotent Algebras. (Q5005117) (← links)
• Satisfiability in MultiValued Circuits (Q5080482) (← links)
• Even Faster Algorithms for CSAT Over supernilpotent Algebras. (Q5089225) (← links)
• Equation satisfiability in solvable groups (Q6614610) (← links)
• Complexity of modular circuits (Q6649462) (← links)