ON THE COMPLEXITY OF DECIDING HOMOMORPHISM-HOMOGENEITY FOR FINITE ALGEBRAS
From MaRDI portal
Publication:4923206
DOI10.1142/S0218196713500148zbMath1283.08007OpenAlexW1976958456MaRDI QIDQ4923206
Publication date: 5 June 2013
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196713500148
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Finitary algebras (08A62)
Related Items (1)
Cites Work
- On finite reflexive homomorphism-homogeneous binary relational systems
- Remarks on homomorphism-homogeneous lattices and semilattices
- Posets, homomorphisms and homogeneity
- Homomorphism-homogeneous partially ordered sets
- Homomorphism-homogeneous graphs
- Homomorphism-Homogeneous Relational Structures
- Finite homomorphism-homogeneous tournaments with loops
- Finite quasi-injective groups
This page was built for publication: ON THE COMPLEXITY OF DECIDING HOMOMORPHISM-HOMOGENEITY FOR FINITE ALGEBRAS