Pages that link to "Item:Q1869963"
From MaRDI portal
The following pages link to Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem (Q1869963):
Displaying 9 items.
- Identity checking problem for transformation monoids (Q444673) (← links)
- Equivalence and equation solvability problems for the alternating group \(\mathbf A_4\). (Q1934970) (← links)
- The complexity of homomorphism factorization (Q2046363) (← links)
- Complexity issues of checking identities in finite monoids (Q2655464) (← links)
- The complexity of homomorphism and constraint satisfaction problems seen from the other side (Q3546332) (← links)
- (Q3615792) (← links)
- MONOIDS AND COMPUTATIONS (Q4658713) (← links)
- THE PERKINS SEMIGROUP HAS CO-NP-COMPLETE TERM-EQUIVALENCE PROBLEM (Q5461667) (← links)
- TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS (Q5483456) (← links)