Pages that link to "Item:Q4923206"
From MaRDI portal
The following pages link to ON THE COMPLEXITY OF DECIDING HOMOMORPHISM-HOMOGENEITY FOR FINITE ALGEBRAS (Q4923206):
Displaying 3 items.
- Towards the characterization of finite homomorphism-homogeneous oriented graphs with loops (Q497356) (← links)
- The computational complexity of deciding whether a finite algebra generates a minimal variety (Q4586419) (← links)
- Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes (Q5066140) (← links)